/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:46:11,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:46:11,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:46:11,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:46:11,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:46:11,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:46:11,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:46:11,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:46:11,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:46:11,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:46:11,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:46:11,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:46:11,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:46:11,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:46:11,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:46:11,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:46:11,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:46:11,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:46:11,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:46:11,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:46:11,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:46:11,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:46:11,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:46:11,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:46:11,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:46:11,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:46:11,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:46:11,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:46:11,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:46:11,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:46:11,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:46:11,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:46:11,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:46:11,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:46:11,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:46:11,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:46:11,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:46:11,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:46:11,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:46:11,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:46:11,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:46:11,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:46:12,008 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:46:12,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:46:12,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:46:12,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:46:12,013 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:46:12,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:46:12,013 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:46:12,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:46:12,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:46:12,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:46:12,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:46:12,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:46:12,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:46:12,018 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:46:12,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:46:12,018 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:46:12,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:46:12,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:46:12,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:46:12,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:46:12,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:46:12,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:46:12,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:46:12,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:46:12,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:46:12,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:46:12,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:46:12,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:46:12,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:46:12,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:46:12,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:46:12,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:46:12,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:46:12,328 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:46:12,328 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:46:12,329 INFO L429 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 [2020-07-08 12:46:12,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790f2eff4/8d5285a33252488f957f1b2400232c0b/FLAG718b1c61d [2020-07-08 12:46:12,909 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:46:12,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-08 12:46:12,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790f2eff4/8d5285a33252488f957f1b2400232c0b/FLAG718b1c61d [2020-07-08 12:46:13,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790f2eff4/8d5285a33252488f957f1b2400232c0b [2020-07-08 12:46:13,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:46:13,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:46:13,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:13,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:46:13,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:46:13,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1689f525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13, skipping insertion in model container [2020-07-08 12:46:13,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:46:13,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:46:13,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:13,494 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:46:13,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:13,627 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:46:13,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13 WrapperNode [2020-07-08 12:46:13,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:13,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:46:13,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:46:13,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:46:13,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:46:13,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:46:13,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:46:13,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:46:13,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:46:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:46:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:46:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:46:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-07-08 12:46:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-07-08 12:46:13,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:46:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:46:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-08 12:46:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:46:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-08 12:46:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-08 12:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-08 12:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-08 12:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-07-08 12:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-08 12:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-08 12:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-08 12:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-08 12:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-08 12:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-08 12:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-08 12:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-08 12:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-08 12:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-07-08 12:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-07-08 12:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-07-08 12:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-07-08 12:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-07-08 12:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-07-08 12:46:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-07-08 12:46:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-07-08 12:46:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-07-08 12:46:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-07-08 12:46:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-07-08 12:46:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:46:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:46:14,334 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:46:14,334 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-08 12:46:14,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:14 BoogieIcfgContainer [2020-07-08 12:46:14,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:46:14,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:46:14,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:46:14,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:46:14,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:46:13" (1/3) ... [2020-07-08 12:46:14,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb3fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:14, skipping insertion in model container [2020-07-08 12:46:14,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (2/3) ... [2020-07-08 12:46:14,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb3fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:14, skipping insertion in model container [2020-07-08 12:46:14,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:14" (3/3) ... [2020-07-08 12:46:14,362 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-08 12:46:14,372 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:46:14,380 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:46:14,393 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:46:14,416 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:46:14,416 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:46:14,417 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:46:14,417 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:46:14,417 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:46:14,417 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:46:14,418 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:46:14,418 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:46:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-08 12:46:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 12:46:14,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:14,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:14,451 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1663477819, now seen corresponding path program 1 times [2020-07-08 12:46:14,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:14,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934372279] [2020-07-08 12:46:14,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:14,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2020-07-08 12:46:14,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 12:46:14,758 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #151#return; {58#true} is VALID [2020-07-08 12:46:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:14,790 INFO L280 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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {58#true} is VALID [2020-07-08 12:46:14,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 12:46:14,793 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {59#false} #147#return; {59#false} is VALID [2020-07-08 12:46:14,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:14,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2020-07-08 12:46:14,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 12:46:14,796 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #151#return; {58#true} is VALID [2020-07-08 12:46:14,797 INFO L263 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret23 := main(); {58#true} is VALID [2020-07-08 12:46:14,798 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {63#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:14,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#(= 0 main_~i~1)} assume !(~i~1 < 8); {59#false} is VALID [2020-07-08 12:46:14,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {59#false} is VALID [2020-07-08 12:46:14,800 INFO L263 TraceCheckUtils]: 8: Hoare triple {59#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {59#false} is VALID [2020-07-08 12:46:14,801 INFO L280 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 [2020-07-08 12:46:14,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#false} assume !(~str.base == 0 && ~str.offset == 0); {59#false} is VALID [2020-07-08 12:46:14,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {59#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {59#false} is VALID [2020-07-08 12:46:14,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {59#false} assume #t~switch4; {59#false} is VALID [2020-07-08 12:46:14,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#false} assume !true; {59#false} is VALID [2020-07-08 12:46:14,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {59#false} is VALID [2020-07-08 12:46:14,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {59#false} is VALID [2020-07-08 12:46:14,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#false} ~j~0 := ~i~0 - 1; {59#false} is VALID [2020-07-08 12:46:14,804 INFO L280 TraceCheckUtils]: 17: Hoare triple {59#false} assume !true; {59#false} is VALID [2020-07-08 12:46:14,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {59#false} #t~short17 := 0 < ~j~0; {59#false} is VALID [2020-07-08 12:46:14,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {59#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {59#false} is VALID [2020-07-08 12:46:14,805 INFO L280 TraceCheckUtils]: 20: Hoare triple {59#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {59#false} is VALID [2020-07-08 12:46:14,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} assume ~start~0 <= ~j~0; {59#false} is VALID [2020-07-08 12:46:14,806 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume !(1 + (~j~0 - ~start~0) >= 2); {59#false} is VALID [2020-07-08 12:46:14,807 INFO L263 TraceCheckUtils]: 23: Hoare triple {59#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {58#true} is VALID [2020-07-08 12:46:14,808 INFO L280 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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {58#true} is VALID [2020-07-08 12:46:14,808 INFO L280 TraceCheckUtils]: 25: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 12:46:14,808 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {58#true} {59#false} #147#return; {59#false} is VALID [2020-07-08 12:46:14,809 INFO L280 TraceCheckUtils]: 27: Hoare triple {59#false} havoc #t~ret19.base, #t~ret19.offset; {59#false} is VALID [2020-07-08 12:46:14,809 INFO L263 TraceCheckUtils]: 28: Hoare triple {59#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {59#false} is VALID [2020-07-08 12:46:14,810 INFO L280 TraceCheckUtils]: 29: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-08 12:46:14,810 INFO L280 TraceCheckUtils]: 30: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-08 12:46:14,810 INFO L280 TraceCheckUtils]: 31: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-08 12:46:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:14,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934372279] [2020-07-08 12:46:14,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:14,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:46:14,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502695519] [2020-07-08 12:46:14,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-08 12:46:14,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:14,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:46:14,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:14,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:46:14,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:46:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:14,904 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2020-07-08 12:46:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:15,324 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2020-07-08 12:46:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:46:15,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-08 12:46:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-08 12:46:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-08 12:46:15,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2020-07-08 12:46:15,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:15,553 INFO L225 Difference]: With dead ends: 104 [2020-07-08 12:46:15,554 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 12:46:15,558 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 12:46:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-08 12:46:15,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:15,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-08 12:46:15,614 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-08 12:46:15,615 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-08 12:46:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:15,620 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-08 12:46:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-08 12:46:15,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:15,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:15,621 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-08 12:46:15,622 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-08 12:46:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:15,627 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-08 12:46:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-08 12:46:15,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:15,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:15,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:15,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-08 12:46:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2020-07-08 12:46:15,634 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2020-07-08 12:46:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:15,634 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2020-07-08 12:46:15,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:46:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-08 12:46:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:46:15,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:15,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:15,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:46:15,637 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash 227833136, now seen corresponding path program 1 times [2020-07-08 12:46:15,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:15,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014116932] [2020-07-08 12:46:15,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-08 12:46:15,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-08 12:46:15,784 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-08 12:46:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {359#true} is VALID [2020-07-08 12:46:15,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-08 12:46:15,804 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {359#true} {360#false} #147#return; {360#false} is VALID [2020-07-08 12:46:15,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:15,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-08 12:46:15,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-08 12:46:15,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-08 12:46:15,808 INFO L263 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret23 := main(); {359#true} is VALID [2020-07-08 12:46:15,809 INFO L280 TraceCheckUtils]: 5: Hoare triple {359#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {364#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:15,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {364#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:15,811 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {365#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:15,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {365#(<= main_~i~1 1)} assume !(~i~1 < 8); {360#false} is VALID [2020-07-08 12:46:15,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {360#false} is VALID [2020-07-08 12:46:15,813 INFO L263 TraceCheckUtils]: 10: Hoare triple {360#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {360#false} is VALID [2020-07-08 12:46:15,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#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); {360#false} is VALID [2020-07-08 12:46:15,813 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#false} assume !(~str.base == 0 && ~str.offset == 0); {360#false} is VALID [2020-07-08 12:46:15,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {360#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {360#false} is VALID [2020-07-08 12:46:15,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#false} assume #t~switch4; {360#false} is VALID [2020-07-08 12:46:15,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {360#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {360#false} is VALID [2020-07-08 12:46:15,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {360#false} assume #t~short7; {360#false} is VALID [2020-07-08 12:46:15,816 INFO L280 TraceCheckUtils]: 17: Hoare triple {360#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {360#false} is VALID [2020-07-08 12:46:15,816 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {360#false} is VALID [2020-07-08 12:46:15,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {360#false} is VALID [2020-07-08 12:46:15,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#false} ~j~0 := ~i~0 - 1; {360#false} is VALID [2020-07-08 12:46:15,817 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#false} #t~short14 := 0 < ~j~0; {360#false} is VALID [2020-07-08 12:46:15,817 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#false} assume !#t~short14; {360#false} is VALID [2020-07-08 12:46:15,817 INFO L280 TraceCheckUtils]: 23: Hoare triple {360#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {360#false} is VALID [2020-07-08 12:46:15,818 INFO L280 TraceCheckUtils]: 24: Hoare triple {360#false} #t~short17 := 0 < ~j~0; {360#false} is VALID [2020-07-08 12:46:15,818 INFO L280 TraceCheckUtils]: 25: Hoare triple {360#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {360#false} is VALID [2020-07-08 12:46:15,819 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {360#false} is VALID [2020-07-08 12:46:15,819 INFO L280 TraceCheckUtils]: 27: Hoare triple {360#false} assume ~start~0 <= ~j~0; {360#false} is VALID [2020-07-08 12:46:15,819 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#false} assume !(1 + (~j~0 - ~start~0) >= 2); {360#false} is VALID [2020-07-08 12:46:15,820 INFO L263 TraceCheckUtils]: 29: Hoare triple {360#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {359#true} is VALID [2020-07-08 12:46:15,820 INFO L280 TraceCheckUtils]: 30: Hoare triple {359#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {359#true} is VALID [2020-07-08 12:46:15,821 INFO L280 TraceCheckUtils]: 31: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-08 12:46:15,821 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {359#true} {360#false} #147#return; {360#false} is VALID [2020-07-08 12:46:15,821 INFO L280 TraceCheckUtils]: 33: Hoare triple {360#false} havoc #t~ret19.base, #t~ret19.offset; {360#false} is VALID [2020-07-08 12:46:15,822 INFO L263 TraceCheckUtils]: 34: Hoare triple {360#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {360#false} is VALID [2020-07-08 12:46:15,822 INFO L280 TraceCheckUtils]: 35: Hoare triple {360#false} ~cond := #in~cond; {360#false} is VALID [2020-07-08 12:46:15,823 INFO L280 TraceCheckUtils]: 36: Hoare triple {360#false} assume 0 == ~cond; {360#false} is VALID [2020-07-08 12:46:15,823 INFO L280 TraceCheckUtils]: 37: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-08 12:46:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:15,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014116932] [2020-07-08 12:46:15,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009956939] [2020-07-08 12:46:15,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-08 12:46:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:16,005 INFO L263 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {359#true} is VALID [2020-07-08 12:46:16,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-08 12:46:16,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-08 12:46:16,006 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-08 12:46:16,006 INFO L263 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret23 := main(); {359#true} is VALID [2020-07-08 12:46:16,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {359#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {359#true} is VALID [2020-07-08 12:46:16,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {359#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {359#true} is VALID [2020-07-08 12:46:16,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {359#true} is VALID [2020-07-08 12:46:16,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#true} assume !(~i~1 < 8); {359#true} is VALID [2020-07-08 12:46:16,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {359#true} is VALID [2020-07-08 12:46:16,009 INFO L263 TraceCheckUtils]: 10: Hoare triple {359#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {359#true} is VALID [2020-07-08 12:46:16,009 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#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); {359#true} is VALID [2020-07-08 12:46:16,009 INFO L280 TraceCheckUtils]: 12: Hoare triple {359#true} assume !(~str.base == 0 && ~str.offset == 0); {359#true} is VALID [2020-07-08 12:46:16,010 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {359#true} is VALID [2020-07-08 12:46:16,010 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#true} assume #t~switch4; {359#true} is VALID [2020-07-08 12:46:16,011 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {359#true} is VALID [2020-07-08 12:46:16,012 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#true} assume #t~short7; {421#|parse_expression_list_#t~short7|} is VALID [2020-07-08 12:46:16,013 INFO L280 TraceCheckUtils]: 17: Hoare triple {421#|parse_expression_list_#t~short7|} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {360#false} is VALID [2020-07-08 12:46:16,013 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {360#false} is VALID [2020-07-08 12:46:16,014 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {360#false} is VALID [2020-07-08 12:46:16,014 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#false} ~j~0 := ~i~0 - 1; {360#false} is VALID [2020-07-08 12:46:16,014 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#false} #t~short14 := 0 < ~j~0; {360#false} is VALID [2020-07-08 12:46:16,015 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#false} assume !#t~short14; {360#false} is VALID [2020-07-08 12:46:16,015 INFO L280 TraceCheckUtils]: 23: Hoare triple {360#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {360#false} is VALID [2020-07-08 12:46:16,015 INFO L280 TraceCheckUtils]: 24: Hoare triple {360#false} #t~short17 := 0 < ~j~0; {360#false} is VALID [2020-07-08 12:46:16,016 INFO L280 TraceCheckUtils]: 25: Hoare triple {360#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {360#false} is VALID [2020-07-08 12:46:16,016 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {360#false} is VALID [2020-07-08 12:46:16,017 INFO L280 TraceCheckUtils]: 27: Hoare triple {360#false} assume ~start~0 <= ~j~0; {360#false} is VALID [2020-07-08 12:46:16,017 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#false} assume !(1 + (~j~0 - ~start~0) >= 2); {360#false} is VALID [2020-07-08 12:46:16,017 INFO L263 TraceCheckUtils]: 29: Hoare triple {360#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {360#false} is VALID [2020-07-08 12:46:16,018 INFO L280 TraceCheckUtils]: 30: Hoare triple {360#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {360#false} is VALID [2020-07-08 12:46:16,018 INFO L280 TraceCheckUtils]: 31: Hoare triple {360#false} assume true; {360#false} is VALID [2020-07-08 12:46:16,018 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {360#false} {360#false} #147#return; {360#false} is VALID [2020-07-08 12:46:16,019 INFO L280 TraceCheckUtils]: 33: Hoare triple {360#false} havoc #t~ret19.base, #t~ret19.offset; {360#false} is VALID [2020-07-08 12:46:16,019 INFO L263 TraceCheckUtils]: 34: Hoare triple {360#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {360#false} is VALID [2020-07-08 12:46:16,019 INFO L280 TraceCheckUtils]: 35: Hoare triple {360#false} ~cond := #in~cond; {360#false} is VALID [2020-07-08 12:46:16,020 INFO L280 TraceCheckUtils]: 36: Hoare triple {360#false} assume 0 == ~cond; {360#false} is VALID [2020-07-08 12:46:16,020 INFO L280 TraceCheckUtils]: 37: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-08 12:46:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:46:16,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:16,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-08 12:46:16,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146539611] [2020-07-08 12:46:16,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-08 12:46:16,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:16,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:46:16,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:16,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:46:16,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:16,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:46:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:16,114 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2020-07-08 12:46:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:16,264 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-07-08 12:46:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:46:16,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-08 12:46:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:46:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-08 12:46:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:46:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-08 12:46:16,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-08 12:46:16,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:16,413 INFO L225 Difference]: With dead ends: 84 [2020-07-08 12:46:16,414 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 12:46:16,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 12:46:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-08 12:46:16,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:16,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-08 12:46:16,438 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-08 12:46:16,439 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-08 12:46:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:16,442 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-08 12:46:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-08 12:46:16,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:16,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:16,443 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-08 12:46:16,443 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-08 12:46:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:16,447 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-08 12:46:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-08 12:46:16,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:16,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:16,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:16,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 12:46:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2020-07-08 12:46:16,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 38 [2020-07-08 12:46:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:16,452 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2020-07-08 12:46:16,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:46:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-08 12:46:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:46:16,454 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:16,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:16,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:46:16,669 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 446687854, now seen corresponding path program 1 times [2020-07-08 12:46:16,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:16,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340732920] [2020-07-08 12:46:16,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-08 12:46:16,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 12:46:16,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-08 12:46:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {752#true} is VALID [2020-07-08 12:46:16,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 12:46:16,754 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {753#false} #147#return; {753#false} is VALID [2020-07-08 12:46:16,756 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:16,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-08 12:46:16,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 12:46:16,757 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-08 12:46:16,757 INFO L263 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret23 := main(); {752#true} is VALID [2020-07-08 12:46:16,758 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {757#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:16,759 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {757#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:16,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {758#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:16,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(<= main_~i~1 1)} assume !(~i~1 < 8); {753#false} is VALID [2020-07-08 12:46:16,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {753#false} is VALID [2020-07-08 12:46:16,762 INFO L263 TraceCheckUtils]: 10: Hoare triple {753#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {753#false} is VALID [2020-07-08 12:46:16,763 INFO L280 TraceCheckUtils]: 11: Hoare triple {753#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); {753#false} is VALID [2020-07-08 12:46:16,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#false} assume !(~str.base == 0 && ~str.offset == 0); {753#false} is VALID [2020-07-08 12:46:16,763 INFO L280 TraceCheckUtils]: 13: Hoare triple {753#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {753#false} is VALID [2020-07-08 12:46:16,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {753#false} assume #t~switch4; {753#false} is VALID [2020-07-08 12:46:16,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {753#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {753#false} is VALID [2020-07-08 12:46:16,764 INFO L280 TraceCheckUtils]: 16: Hoare triple {753#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {753#false} is VALID [2020-07-08 12:46:16,764 INFO L280 TraceCheckUtils]: 17: Hoare triple {753#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {753#false} is VALID [2020-07-08 12:46:16,765 INFO L280 TraceCheckUtils]: 18: Hoare triple {753#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {753#false} is VALID [2020-07-08 12:46:16,765 INFO L280 TraceCheckUtils]: 19: Hoare triple {753#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {753#false} is VALID [2020-07-08 12:46:16,765 INFO L280 TraceCheckUtils]: 20: Hoare triple {753#false} ~j~0 := ~i~0 - 1; {753#false} is VALID [2020-07-08 12:46:16,765 INFO L280 TraceCheckUtils]: 21: Hoare triple {753#false} #t~short14 := 0 < ~j~0; {753#false} is VALID [2020-07-08 12:46:16,766 INFO L280 TraceCheckUtils]: 22: Hoare triple {753#false} assume !#t~short14; {753#false} is VALID [2020-07-08 12:46:16,766 INFO L280 TraceCheckUtils]: 23: Hoare triple {753#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {753#false} is VALID [2020-07-08 12:46:16,766 INFO L280 TraceCheckUtils]: 24: Hoare triple {753#false} #t~short17 := 0 < ~j~0; {753#false} is VALID [2020-07-08 12:46:16,767 INFO L280 TraceCheckUtils]: 25: Hoare triple {753#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {753#false} is VALID [2020-07-08 12:46:16,767 INFO L280 TraceCheckUtils]: 26: Hoare triple {753#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {753#false} is VALID [2020-07-08 12:46:16,767 INFO L280 TraceCheckUtils]: 27: Hoare triple {753#false} assume ~start~0 <= ~j~0; {753#false} is VALID [2020-07-08 12:46:16,767 INFO L280 TraceCheckUtils]: 28: Hoare triple {753#false} assume !(1 + (~j~0 - ~start~0) >= 2); {753#false} is VALID [2020-07-08 12:46:16,768 INFO L263 TraceCheckUtils]: 29: Hoare triple {753#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {752#true} is VALID [2020-07-08 12:46:16,768 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {752#true} is VALID [2020-07-08 12:46:16,768 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 12:46:16,769 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {752#true} {753#false} #147#return; {753#false} is VALID [2020-07-08 12:46:16,769 INFO L280 TraceCheckUtils]: 33: Hoare triple {753#false} havoc #t~ret19.base, #t~ret19.offset; {753#false} is VALID [2020-07-08 12:46:16,769 INFO L263 TraceCheckUtils]: 34: Hoare triple {753#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {753#false} is VALID [2020-07-08 12:46:16,769 INFO L280 TraceCheckUtils]: 35: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2020-07-08 12:46:16,770 INFO L280 TraceCheckUtils]: 36: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2020-07-08 12:46:16,770 INFO L280 TraceCheckUtils]: 37: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-08 12:46:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:16,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340732920] [2020-07-08 12:46:16,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962751330] [2020-07-08 12:46:16,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:46:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:16,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:16,949 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:16,977 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-08 12:46:16,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-08 12:46:16,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 12:46:16,978 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-08 12:46:16,978 INFO L263 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret23 := main(); {752#true} is VALID [2020-07-08 12:46:16,978 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {752#true} is VALID [2020-07-08 12:46:16,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {752#true} is VALID [2020-07-08 12:46:16,979 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {752#true} is VALID [2020-07-08 12:46:16,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume !(~i~1 < 8); {752#true} is VALID [2020-07-08 12:46:16,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {752#true} is VALID [2020-07-08 12:46:16,980 INFO L263 TraceCheckUtils]: 10: Hoare triple {752#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {752#true} is VALID [2020-07-08 12:46:16,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#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); {752#true} is VALID [2020-07-08 12:46:16,980 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume !(~str.base == 0 && ~str.offset == 0); {752#true} is VALID [2020-07-08 12:46:16,980 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {752#true} is VALID [2020-07-08 12:46:16,981 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} assume #t~switch4; {752#true} is VALID [2020-07-08 12:46:16,981 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {752#true} is VALID [2020-07-08 12:46:16,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {752#true} is VALID [2020-07-08 12:46:16,981 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {752#true} is VALID [2020-07-08 12:46:16,982 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {752#true} is VALID [2020-07-08 12:46:16,982 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {752#true} is VALID [2020-07-08 12:46:16,982 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} ~j~0 := ~i~0 - 1; {752#true} is VALID [2020-07-08 12:46:16,983 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} #t~short14 := 0 < ~j~0; {829#(or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|))} is VALID [2020-07-08 12:46:16,984 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#(or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|))} assume !#t~short14; {833#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 12:46:16,985 INFO L280 TraceCheckUtils]: 23: Hoare triple {833#(<= parse_expression_list_~j~0 0)} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {833#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-08 12:46:16,986 INFO L280 TraceCheckUtils]: 24: Hoare triple {833#(<= parse_expression_list_~j~0 0)} #t~short17 := 0 < ~j~0; {840#(not |parse_expression_list_#t~short17|)} is VALID [2020-07-08 12:46:16,986 INFO L280 TraceCheckUtils]: 25: Hoare triple {840#(not |parse_expression_list_#t~short17|)} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {753#false} is VALID [2020-07-08 12:46:16,987 INFO L280 TraceCheckUtils]: 26: Hoare triple {753#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {753#false} is VALID [2020-07-08 12:46:16,987 INFO L280 TraceCheckUtils]: 27: Hoare triple {753#false} assume ~start~0 <= ~j~0; {753#false} is VALID [2020-07-08 12:46:16,987 INFO L280 TraceCheckUtils]: 28: Hoare triple {753#false} assume !(1 + (~j~0 - ~start~0) >= 2); {753#false} is VALID [2020-07-08 12:46:16,987 INFO L263 TraceCheckUtils]: 29: Hoare triple {753#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {753#false} is VALID [2020-07-08 12:46:16,988 INFO L280 TraceCheckUtils]: 30: Hoare triple {753#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {753#false} is VALID [2020-07-08 12:46:16,988 INFO L280 TraceCheckUtils]: 31: Hoare triple {753#false} assume true; {753#false} is VALID [2020-07-08 12:46:16,988 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {753#false} {753#false} #147#return; {753#false} is VALID [2020-07-08 12:46:16,989 INFO L280 TraceCheckUtils]: 33: Hoare triple {753#false} havoc #t~ret19.base, #t~ret19.offset; {753#false} is VALID [2020-07-08 12:46:16,989 INFO L263 TraceCheckUtils]: 34: Hoare triple {753#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {753#false} is VALID [2020-07-08 12:46:16,989 INFO L280 TraceCheckUtils]: 35: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2020-07-08 12:46:16,989 INFO L280 TraceCheckUtils]: 36: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2020-07-08 12:46:16,990 INFO L280 TraceCheckUtils]: 37: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-08 12:46:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:46:16,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:16,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-08 12:46:16,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46094702] [2020-07-08 12:46:16,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-08 12:46:16,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:16,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:17,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:17,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:17,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:17,037 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2020-07-08 12:46:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:17,355 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2020-07-08 12:46:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:17,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-08 12:46:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2020-07-08 12:46:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2020-07-08 12:46:17,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2020-07-08 12:46:17,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:17,508 INFO L225 Difference]: With dead ends: 109 [2020-07-08 12:46:17,508 INFO L226 Difference]: Without dead ends: 73 [2020-07-08 12:46:17,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:46:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-08 12:46:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2020-07-08 12:46:17,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:17,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 53 states. [2020-07-08 12:46:17,534 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 53 states. [2020-07-08 12:46:17,534 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 53 states. [2020-07-08 12:46:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:17,540 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-08 12:46:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-08 12:46:17,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:17,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:17,544 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 73 states. [2020-07-08 12:46:17,547 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 73 states. [2020-07-08 12:46:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:17,553 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-08 12:46:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-08 12:46:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:17,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:17,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-08 12:46:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2020-07-08 12:46:17,560 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 38 [2020-07-08 12:46:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:17,560 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2020-07-08 12:46:17,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2020-07-08 12:46:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:46:17,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:17,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:17,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:17,779 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:17,780 INFO L82 PathProgramCache]: Analyzing trace with hash -140118160, now seen corresponding path program 1 times [2020-07-08 12:46:17,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:17,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632705571] [2020-07-08 12:46:17,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-08 12:46:17,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-08 12:46:17,870 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-08 12:46:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {1232#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1232#true} is VALID [2020-07-08 12:46:17,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-08 12:46:17,876 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1233#false} #147#return; {1233#false} is VALID [2020-07-08 12:46:17,877 INFO L263 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:17,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-08 12:46:17,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-08 12:46:17,878 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-08 12:46:17,878 INFO L263 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret23 := main(); {1232#true} is VALID [2020-07-08 12:46:17,879 INFO L280 TraceCheckUtils]: 5: Hoare triple {1232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1237#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:17,879 INFO L280 TraceCheckUtils]: 6: Hoare triple {1237#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1237#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:17,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {1237#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1238#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:17,881 INFO L280 TraceCheckUtils]: 8: Hoare triple {1238#(<= main_~i~1 1)} assume !(~i~1 < 8); {1233#false} is VALID [2020-07-08 12:46:17,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {1233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1233#false} is VALID [2020-07-08 12:46:17,881 INFO L263 TraceCheckUtils]: 10: Hoare triple {1233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1233#false} is VALID [2020-07-08 12:46:17,881 INFO L280 TraceCheckUtils]: 11: Hoare triple {1233#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); {1233#false} is VALID [2020-07-08 12:46:17,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {1233#false} assume !(~str.base == 0 && ~str.offset == 0); {1233#false} is VALID [2020-07-08 12:46:17,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {1233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1233#false} is VALID [2020-07-08 12:46:17,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#false} assume #t~switch4; {1233#false} is VALID [2020-07-08 12:46:17,882 INFO L280 TraceCheckUtils]: 15: Hoare triple {1233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1233#false} is VALID [2020-07-08 12:46:17,882 INFO L280 TraceCheckUtils]: 16: Hoare triple {1233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1233#false} is VALID [2020-07-08 12:46:17,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {1233#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {1233#false} is VALID [2020-07-08 12:46:17,883 INFO L280 TraceCheckUtils]: 18: Hoare triple {1233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1233#false} is VALID [2020-07-08 12:46:17,883 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1233#false} is VALID [2020-07-08 12:46:17,883 INFO L280 TraceCheckUtils]: 20: Hoare triple {1233#false} ~j~0 := ~i~0 - 1; {1233#false} is VALID [2020-07-08 12:46:17,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {1233#false} #t~short14 := 0 < ~j~0; {1233#false} is VALID [2020-07-08 12:46:17,884 INFO L280 TraceCheckUtils]: 22: Hoare triple {1233#false} assume !#t~short14; {1233#false} is VALID [2020-07-08 12:46:17,884 INFO L280 TraceCheckUtils]: 23: Hoare triple {1233#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {1233#false} is VALID [2020-07-08 12:46:17,884 INFO L280 TraceCheckUtils]: 24: Hoare triple {1233#false} #t~short17 := 0 < ~j~0; {1233#false} is VALID [2020-07-08 12:46:17,884 INFO L280 TraceCheckUtils]: 25: Hoare triple {1233#false} assume !#t~short17; {1233#false} is VALID [2020-07-08 12:46:17,885 INFO L280 TraceCheckUtils]: 26: Hoare triple {1233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1233#false} is VALID [2020-07-08 12:46:17,885 INFO L280 TraceCheckUtils]: 27: Hoare triple {1233#false} assume ~start~0 <= ~j~0; {1233#false} is VALID [2020-07-08 12:46:17,885 INFO L280 TraceCheckUtils]: 28: Hoare triple {1233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1233#false} is VALID [2020-07-08 12:46:17,885 INFO L263 TraceCheckUtils]: 29: Hoare triple {1233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1232#true} is VALID [2020-07-08 12:46:17,886 INFO L280 TraceCheckUtils]: 30: Hoare triple {1232#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1232#true} is VALID [2020-07-08 12:46:17,886 INFO L280 TraceCheckUtils]: 31: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-08 12:46:17,886 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1232#true} {1233#false} #147#return; {1233#false} is VALID [2020-07-08 12:46:17,886 INFO L280 TraceCheckUtils]: 33: Hoare triple {1233#false} havoc #t~ret19.base, #t~ret19.offset; {1233#false} is VALID [2020-07-08 12:46:17,886 INFO L263 TraceCheckUtils]: 34: Hoare triple {1233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1233#false} is VALID [2020-07-08 12:46:17,887 INFO L280 TraceCheckUtils]: 35: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2020-07-08 12:46:17,887 INFO L280 TraceCheckUtils]: 36: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2020-07-08 12:46:17,887 INFO L280 TraceCheckUtils]: 37: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2020-07-08 12:46:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:17,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632705571] [2020-07-08 12:46:17,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006660438] [2020-07-08 12:46:17,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,950 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:46:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:18,016 INFO L263 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1232#true} is VALID [2020-07-08 12:46:18,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-08 12:46:18,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-08 12:46:18,017 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-08 12:46:18,017 INFO L263 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret23 := main(); {1232#true} is VALID [2020-07-08 12:46:18,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {1232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1261#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:18,019 INFO L280 TraceCheckUtils]: 6: Hoare triple {1261#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1261#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:18,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {1261#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1238#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:18,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {1238#(<= main_~i~1 1)} assume !(~i~1 < 8); {1233#false} is VALID [2020-07-08 12:46:18,021 INFO L280 TraceCheckUtils]: 9: Hoare triple {1233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1233#false} is VALID [2020-07-08 12:46:18,021 INFO L263 TraceCheckUtils]: 10: Hoare triple {1233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1233#false} is VALID [2020-07-08 12:46:18,021 INFO L280 TraceCheckUtils]: 11: Hoare triple {1233#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); {1233#false} is VALID [2020-07-08 12:46:18,022 INFO L280 TraceCheckUtils]: 12: Hoare triple {1233#false} assume !(~str.base == 0 && ~str.offset == 0); {1233#false} is VALID [2020-07-08 12:46:18,022 INFO L280 TraceCheckUtils]: 13: Hoare triple {1233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1233#false} is VALID [2020-07-08 12:46:18,022 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#false} assume #t~switch4; {1233#false} is VALID [2020-07-08 12:46:18,022 INFO L280 TraceCheckUtils]: 15: Hoare triple {1233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1233#false} is VALID [2020-07-08 12:46:18,023 INFO L280 TraceCheckUtils]: 16: Hoare triple {1233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1233#false} is VALID [2020-07-08 12:46:18,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {1233#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {1233#false} is VALID [2020-07-08 12:46:18,023 INFO L280 TraceCheckUtils]: 18: Hoare triple {1233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1233#false} is VALID [2020-07-08 12:46:18,023 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1233#false} is VALID [2020-07-08 12:46:18,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {1233#false} ~j~0 := ~i~0 - 1; {1233#false} is VALID [2020-07-08 12:46:18,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {1233#false} #t~short14 := 0 < ~j~0; {1233#false} is VALID [2020-07-08 12:46:18,024 INFO L280 TraceCheckUtils]: 22: Hoare triple {1233#false} assume !#t~short14; {1233#false} is VALID [2020-07-08 12:46:18,024 INFO L280 TraceCheckUtils]: 23: Hoare triple {1233#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {1233#false} is VALID [2020-07-08 12:46:18,024 INFO L280 TraceCheckUtils]: 24: Hoare triple {1233#false} #t~short17 := 0 < ~j~0; {1233#false} is VALID [2020-07-08 12:46:18,025 INFO L280 TraceCheckUtils]: 25: Hoare triple {1233#false} assume !#t~short17; {1233#false} is VALID [2020-07-08 12:46:18,025 INFO L280 TraceCheckUtils]: 26: Hoare triple {1233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1233#false} is VALID [2020-07-08 12:46:18,025 INFO L280 TraceCheckUtils]: 27: Hoare triple {1233#false} assume ~start~0 <= ~j~0; {1233#false} is VALID [2020-07-08 12:46:18,025 INFO L280 TraceCheckUtils]: 28: Hoare triple {1233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1233#false} is VALID [2020-07-08 12:46:18,026 INFO L263 TraceCheckUtils]: 29: Hoare triple {1233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1233#false} is VALID [2020-07-08 12:46:18,026 INFO L280 TraceCheckUtils]: 30: Hoare triple {1233#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1233#false} is VALID [2020-07-08 12:46:18,026 INFO L280 TraceCheckUtils]: 31: Hoare triple {1233#false} assume true; {1233#false} is VALID [2020-07-08 12:46:18,027 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1233#false} {1233#false} #147#return; {1233#false} is VALID [2020-07-08 12:46:18,027 INFO L280 TraceCheckUtils]: 33: Hoare triple {1233#false} havoc #t~ret19.base, #t~ret19.offset; {1233#false} is VALID [2020-07-08 12:46:18,027 INFO L263 TraceCheckUtils]: 34: Hoare triple {1233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1233#false} is VALID [2020-07-08 12:46:18,027 INFO L280 TraceCheckUtils]: 35: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2020-07-08 12:46:18,027 INFO L280 TraceCheckUtils]: 36: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2020-07-08 12:46:18,028 INFO L280 TraceCheckUtils]: 37: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2020-07-08 12:46:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:18,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:18,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-08 12:46:18,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165042979] [2020-07-08 12:46:18,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-08 12:46:18,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:18,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:18,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:18,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:18,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:18,092 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2020-07-08 12:46:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,401 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2020-07-08 12:46:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:18,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-08 12:46:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-08 12:46:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-08 12:46:18,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2020-07-08 12:46:18,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:18,539 INFO L225 Difference]: With dead ends: 100 [2020-07-08 12:46:18,539 INFO L226 Difference]: Without dead ends: 56 [2020-07-08 12:46:18,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-08 12:46:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-07-08 12:46:18,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:18,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2020-07-08 12:46:18,567 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2020-07-08 12:46:18,567 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2020-07-08 12:46:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,570 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-08 12:46:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-08 12:46:18,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:18,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:18,571 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2020-07-08 12:46:18,571 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2020-07-08 12:46:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,574 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-08 12:46:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-08 12:46:18,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:18,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:18,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:18,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 12:46:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2020-07-08 12:46:18,578 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 38 [2020-07-08 12:46:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:18,578 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-07-08 12:46:18,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-08 12:46:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 12:46:18,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:18,580 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-08 12:46:18,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:18,793 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1477568014, now seen corresponding path program 2 times [2020-07-08 12:46:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:18,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552549784] [2020-07-08 12:46:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-08 12:46:18,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 12:46:18,873 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-08 12:46:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1665#true} is VALID [2020-07-08 12:46:18,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 12:46:18,888 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1666#false} #147#return; {1666#false} is VALID [2020-07-08 12:46:18,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:18,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-08 12:46:18,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 12:46:18,890 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-08 12:46:18,890 INFO L263 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret23 := main(); {1665#true} is VALID [2020-07-08 12:46:18,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1670#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:18,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {1670#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1670#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:18,894 INFO L280 TraceCheckUtils]: 7: Hoare triple {1670#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1671#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:18,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {1671#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1671#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:18,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {1671#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1672#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:18,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {1672#(<= main_~i~1 2)} assume !(~i~1 < 8); {1666#false} is VALID [2020-07-08 12:46:18,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {1666#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1666#false} is VALID [2020-07-08 12:46:18,897 INFO L263 TraceCheckUtils]: 12: Hoare triple {1666#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1666#false} is VALID [2020-07-08 12:46:18,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {1666#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); {1666#false} is VALID [2020-07-08 12:46:18,898 INFO L280 TraceCheckUtils]: 14: Hoare triple {1666#false} assume !(~str.base == 0 && ~str.offset == 0); {1666#false} is VALID [2020-07-08 12:46:18,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {1666#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1666#false} is VALID [2020-07-08 12:46:18,898 INFO L280 TraceCheckUtils]: 16: Hoare triple {1666#false} assume #t~switch4; {1666#false} is VALID [2020-07-08 12:46:18,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {1666#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1666#false} is VALID [2020-07-08 12:46:18,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {1666#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1666#false} is VALID [2020-07-08 12:46:18,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {1666#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {1666#false} is VALID [2020-07-08 12:46:18,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {1666#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1666#false} is VALID [2020-07-08 12:46:18,899 INFO L280 TraceCheckUtils]: 21: Hoare triple {1666#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1666#false} is VALID [2020-07-08 12:46:18,900 INFO L280 TraceCheckUtils]: 22: Hoare triple {1666#false} ~j~0 := ~i~0 - 1; {1666#false} is VALID [2020-07-08 12:46:18,900 INFO L280 TraceCheckUtils]: 23: Hoare triple {1666#false} #t~short14 := 0 < ~j~0; {1666#false} is VALID [2020-07-08 12:46:18,900 INFO L280 TraceCheckUtils]: 24: Hoare triple {1666#false} assume !#t~short14; {1666#false} is VALID [2020-07-08 12:46:18,900 INFO L280 TraceCheckUtils]: 25: Hoare triple {1666#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {1666#false} is VALID [2020-07-08 12:46:18,901 INFO L280 TraceCheckUtils]: 26: Hoare triple {1666#false} #t~short17 := 0 < ~j~0; {1666#false} is VALID [2020-07-08 12:46:18,901 INFO L280 TraceCheckUtils]: 27: Hoare triple {1666#false} assume !#t~short17; {1666#false} is VALID [2020-07-08 12:46:18,901 INFO L280 TraceCheckUtils]: 28: Hoare triple {1666#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1666#false} is VALID [2020-07-08 12:46:18,901 INFO L280 TraceCheckUtils]: 29: Hoare triple {1666#false} assume ~start~0 <= ~j~0; {1666#false} is VALID [2020-07-08 12:46:18,901 INFO L280 TraceCheckUtils]: 30: Hoare triple {1666#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1666#false} is VALID [2020-07-08 12:46:18,902 INFO L263 TraceCheckUtils]: 31: Hoare triple {1666#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1665#true} is VALID [2020-07-08 12:46:18,902 INFO L280 TraceCheckUtils]: 32: Hoare triple {1665#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1665#true} is VALID [2020-07-08 12:46:18,902 INFO L280 TraceCheckUtils]: 33: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 12:46:18,902 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1665#true} {1666#false} #147#return; {1666#false} is VALID [2020-07-08 12:46:18,903 INFO L280 TraceCheckUtils]: 35: Hoare triple {1666#false} havoc #t~ret19.base, #t~ret19.offset; {1666#false} is VALID [2020-07-08 12:46:18,903 INFO L263 TraceCheckUtils]: 36: Hoare triple {1666#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1666#false} is VALID [2020-07-08 12:46:18,903 INFO L280 TraceCheckUtils]: 37: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2020-07-08 12:46:18,903 INFO L280 TraceCheckUtils]: 38: Hoare triple {1666#false} assume 0 == ~cond; {1666#false} is VALID [2020-07-08 12:46:18,904 INFO L280 TraceCheckUtils]: 39: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-08 12:46:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:18,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552549784] [2020-07-08 12:46:18,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987857388] [2020-07-08 12:46:18,906 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:18,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:46:18,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:18,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:46:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:19,135 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2020-07-08 12:46:19,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-08 12:46:19,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 12:46:19,136 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-08 12:46:19,136 INFO L263 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret23 := main(); {1665#true} is VALID [2020-07-08 12:46:19,136 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1665#true} is VALID [2020-07-08 12:46:19,136 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1665#true} is VALID [2020-07-08 12:46:19,137 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1665#true} is VALID [2020-07-08 12:46:19,137 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1665#true} is VALID [2020-07-08 12:46:19,137 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1665#true} is VALID [2020-07-08 12:46:19,137 INFO L280 TraceCheckUtils]: 10: Hoare triple {1665#true} assume !(~i~1 < 8); {1665#true} is VALID [2020-07-08 12:46:19,138 INFO L280 TraceCheckUtils]: 11: Hoare triple {1665#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1665#true} is VALID [2020-07-08 12:46:19,138 INFO L263 TraceCheckUtils]: 12: Hoare triple {1665#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1665#true} is VALID [2020-07-08 12:46:19,139 INFO L280 TraceCheckUtils]: 13: Hoare triple {1665#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); {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 12:46:19,140 INFO L280 TraceCheckUtils]: 14: Hoare triple {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 12:46:19,141 INFO L280 TraceCheckUtils]: 15: Hoare triple {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,142 INFO L280 TraceCheckUtils]: 16: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,144 INFO L280 TraceCheckUtils]: 18: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,145 INFO L280 TraceCheckUtils]: 19: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,146 INFO L280 TraceCheckUtils]: 20: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,147 INFO L280 TraceCheckUtils]: 21: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1745#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:19,148 INFO L280 TraceCheckUtils]: 22: Hoare triple {1745#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,149 INFO L280 TraceCheckUtils]: 23: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,150 INFO L280 TraceCheckUtils]: 24: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,151 INFO L280 TraceCheckUtils]: 25: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,152 INFO L280 TraceCheckUtils]: 26: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,153 INFO L280 TraceCheckUtils]: 27: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,153 INFO L280 TraceCheckUtils]: 28: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:19,154 INFO L280 TraceCheckUtils]: 29: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1666#false} is VALID [2020-07-08 12:46:19,155 INFO L280 TraceCheckUtils]: 30: Hoare triple {1666#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1666#false} is VALID [2020-07-08 12:46:19,155 INFO L263 TraceCheckUtils]: 31: Hoare triple {1666#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1666#false} is VALID [2020-07-08 12:46:19,155 INFO L280 TraceCheckUtils]: 32: Hoare triple {1666#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1666#false} is VALID [2020-07-08 12:46:19,155 INFO L280 TraceCheckUtils]: 33: Hoare triple {1666#false} assume true; {1666#false} is VALID [2020-07-08 12:46:19,156 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1666#false} {1666#false} #147#return; {1666#false} is VALID [2020-07-08 12:46:19,156 INFO L280 TraceCheckUtils]: 35: Hoare triple {1666#false} havoc #t~ret19.base, #t~ret19.offset; {1666#false} is VALID [2020-07-08 12:46:19,156 INFO L263 TraceCheckUtils]: 36: Hoare triple {1666#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1666#false} is VALID [2020-07-08 12:46:19,156 INFO L280 TraceCheckUtils]: 37: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2020-07-08 12:46:19,157 INFO L280 TraceCheckUtils]: 38: Hoare triple {1666#false} assume 0 == ~cond; {1666#false} is VALID [2020-07-08 12:46:19,157 INFO L280 TraceCheckUtils]: 39: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-08 12:46:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:46:19,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:19,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-07-08 12:46:19,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166452086] [2020-07-08 12:46:19,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-08 12:46:19,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:19,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:19,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:19,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:19,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:46:19,209 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2020-07-08 12:46:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,705 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2020-07-08 12:46:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:19,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-08 12:46:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-08 12:46:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-08 12:46:19,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2020-07-08 12:46:19,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:19,921 INFO L225 Difference]: With dead ends: 147 [2020-07-08 12:46:19,922 INFO L226 Difference]: Without dead ends: 86 [2020-07-08 12:46:19,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:46:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-08 12:46:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 62. [2020-07-08 12:46:19,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:19,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 62 states. [2020-07-08 12:46:19,947 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 62 states. [2020-07-08 12:46:19,948 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 62 states. [2020-07-08 12:46:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,953 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2020-07-08 12:46:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-07-08 12:46:19,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:19,954 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 86 states. [2020-07-08 12:46:19,954 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 86 states. [2020-07-08 12:46:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,959 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2020-07-08 12:46:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-07-08 12:46:19,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:19,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:19,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-08 12:46:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2020-07-08 12:46:19,963 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 40 [2020-07-08 12:46:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:19,963 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-07-08 12:46:19,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2020-07-08 12:46:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 12:46:19,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:19,965 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-08 12:46:20,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:20,178 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1128455540, now seen corresponding path program 1 times [2020-07-08 12:46:20,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:20,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713714446] [2020-07-08 12:46:20,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:20,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-08 12:46:20,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-08 12:46:20,253 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-08 12:46:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:20,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {2232#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2232#true} is VALID [2020-07-08 12:46:20,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-08 12:46:20,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2233#false} #147#return; {2233#false} is VALID [2020-07-08 12:46:20,260 INFO L263 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:20,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-08 12:46:20,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-08 12:46:20,260 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-08 12:46:20,261 INFO L263 TraceCheckUtils]: 4: Hoare triple {2232#true} call #t~ret23 := main(); {2232#true} is VALID [2020-07-08 12:46:20,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {2232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2237#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:20,263 INFO L280 TraceCheckUtils]: 6: Hoare triple {2237#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2237#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:20,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {2237#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2238#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:20,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {2238#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2238#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:20,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {2238#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2239#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:20,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {2239#(<= main_~i~1 2)} assume !(~i~1 < 8); {2233#false} is VALID [2020-07-08 12:46:20,269 INFO L280 TraceCheckUtils]: 11: Hoare triple {2233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2233#false} is VALID [2020-07-08 12:46:20,269 INFO L263 TraceCheckUtils]: 12: Hoare triple {2233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2233#false} is VALID [2020-07-08 12:46:20,269 INFO L280 TraceCheckUtils]: 13: Hoare triple {2233#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); {2233#false} is VALID [2020-07-08 12:46:20,269 INFO L280 TraceCheckUtils]: 14: Hoare triple {2233#false} assume !(~str.base == 0 && ~str.offset == 0); {2233#false} is VALID [2020-07-08 12:46:20,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {2233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2233#false} is VALID [2020-07-08 12:46:20,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {2233#false} assume #t~switch4; {2233#false} is VALID [2020-07-08 12:46:20,270 INFO L280 TraceCheckUtils]: 17: Hoare triple {2233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2233#false} is VALID [2020-07-08 12:46:20,270 INFO L280 TraceCheckUtils]: 18: Hoare triple {2233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2233#false} is VALID [2020-07-08 12:46:20,270 INFO L280 TraceCheckUtils]: 19: Hoare triple {2233#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {2233#false} is VALID [2020-07-08 12:46:20,270 INFO L280 TraceCheckUtils]: 20: Hoare triple {2233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2233#false} is VALID [2020-07-08 12:46:20,270 INFO L280 TraceCheckUtils]: 21: Hoare triple {2233#false} assume !(34 == #t~mem9);havoc #t~mem9; {2233#false} is VALID [2020-07-08 12:46:20,271 INFO L280 TraceCheckUtils]: 22: Hoare triple {2233#false} ~j~0 := ~i~0 - 1; {2233#false} is VALID [2020-07-08 12:46:20,271 INFO L280 TraceCheckUtils]: 23: Hoare triple {2233#false} #t~short14 := 0 < ~j~0; {2233#false} is VALID [2020-07-08 12:46:20,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {2233#false} assume !#t~short14; {2233#false} is VALID [2020-07-08 12:46:20,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {2233#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {2233#false} is VALID [2020-07-08 12:46:20,271 INFO L280 TraceCheckUtils]: 26: Hoare triple {2233#false} #t~short17 := 0 < ~j~0; {2233#false} is VALID [2020-07-08 12:46:20,272 INFO L280 TraceCheckUtils]: 27: Hoare triple {2233#false} assume !#t~short17; {2233#false} is VALID [2020-07-08 12:46:20,272 INFO L280 TraceCheckUtils]: 28: Hoare triple {2233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2233#false} is VALID [2020-07-08 12:46:20,272 INFO L280 TraceCheckUtils]: 29: Hoare triple {2233#false} assume ~start~0 <= ~j~0; {2233#false} is VALID [2020-07-08 12:46:20,272 INFO L280 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2233#false} is VALID [2020-07-08 12:46:20,272 INFO L263 TraceCheckUtils]: 31: Hoare triple {2233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2232#true} is VALID [2020-07-08 12:46:20,273 INFO L280 TraceCheckUtils]: 32: Hoare triple {2232#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2232#true} is VALID [2020-07-08 12:46:20,273 INFO L280 TraceCheckUtils]: 33: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-08 12:46:20,273 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2232#true} {2233#false} #147#return; {2233#false} is VALID [2020-07-08 12:46:20,273 INFO L280 TraceCheckUtils]: 35: Hoare triple {2233#false} havoc #t~ret19.base, #t~ret19.offset; {2233#false} is VALID [2020-07-08 12:46:20,273 INFO L263 TraceCheckUtils]: 36: Hoare triple {2233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2233#false} is VALID [2020-07-08 12:46:20,274 INFO L280 TraceCheckUtils]: 37: Hoare triple {2233#false} ~cond := #in~cond; {2233#false} is VALID [2020-07-08 12:46:20,274 INFO L280 TraceCheckUtils]: 38: Hoare triple {2233#false} assume 0 == ~cond; {2233#false} is VALID [2020-07-08 12:46:20,274 INFO L280 TraceCheckUtils]: 39: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2020-07-08 12:46:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:20,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713714446] [2020-07-08 12:46:20,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940181123] [2020-07-08 12:46:20,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:20,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:46:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:20,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:20,408 INFO L263 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2232#true} is VALID [2020-07-08 12:46:20,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-08 12:46:20,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-08 12:46:20,419 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-08 12:46:20,420 INFO L263 TraceCheckUtils]: 4: Hoare triple {2232#true} call #t~ret23 := main(); {2232#true} is VALID [2020-07-08 12:46:20,421 INFO L280 TraceCheckUtils]: 5: Hoare triple {2232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2262#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:20,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {2262#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2262#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:20,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {2262#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2238#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:20,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {2238#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2238#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:20,423 INFO L280 TraceCheckUtils]: 9: Hoare triple {2238#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2239#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:20,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {2239#(<= main_~i~1 2)} assume !(~i~1 < 8); {2233#false} is VALID [2020-07-08 12:46:20,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {2233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2233#false} is VALID [2020-07-08 12:46:20,424 INFO L263 TraceCheckUtils]: 12: Hoare triple {2233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2233#false} is VALID [2020-07-08 12:46:20,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {2233#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); {2233#false} is VALID [2020-07-08 12:46:20,424 INFO L280 TraceCheckUtils]: 14: Hoare triple {2233#false} assume !(~str.base == 0 && ~str.offset == 0); {2233#false} is VALID [2020-07-08 12:46:20,424 INFO L280 TraceCheckUtils]: 15: Hoare triple {2233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2233#false} is VALID [2020-07-08 12:46:20,425 INFO L280 TraceCheckUtils]: 16: Hoare triple {2233#false} assume #t~switch4; {2233#false} is VALID [2020-07-08 12:46:20,425 INFO L280 TraceCheckUtils]: 17: Hoare triple {2233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2233#false} is VALID [2020-07-08 12:46:20,425 INFO L280 TraceCheckUtils]: 18: Hoare triple {2233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2233#false} is VALID [2020-07-08 12:46:20,425 INFO L280 TraceCheckUtils]: 19: Hoare triple {2233#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {2233#false} is VALID [2020-07-08 12:46:20,425 INFO L280 TraceCheckUtils]: 20: Hoare triple {2233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 21: Hoare triple {2233#false} assume !(34 == #t~mem9);havoc #t~mem9; {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 22: Hoare triple {2233#false} ~j~0 := ~i~0 - 1; {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 23: Hoare triple {2233#false} #t~short14 := 0 < ~j~0; {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 24: Hoare triple {2233#false} assume !#t~short14; {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {2233#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {2233#false} #t~short17 := 0 < ~j~0; {2233#false} is VALID [2020-07-08 12:46:20,426 INFO L280 TraceCheckUtils]: 27: Hoare triple {2233#false} assume !#t~short17; {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L280 TraceCheckUtils]: 28: Hoare triple {2233#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L280 TraceCheckUtils]: 29: Hoare triple {2233#false} assume ~start~0 <= ~j~0; {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L280 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L263 TraceCheckUtils]: 31: Hoare triple {2233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L280 TraceCheckUtils]: 32: Hoare triple {2233#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L280 TraceCheckUtils]: 33: Hoare triple {2233#false} assume true; {2233#false} is VALID [2020-07-08 12:46:20,427 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2233#false} {2233#false} #147#return; {2233#false} is VALID [2020-07-08 12:46:20,428 INFO L280 TraceCheckUtils]: 35: Hoare triple {2233#false} havoc #t~ret19.base, #t~ret19.offset; {2233#false} is VALID [2020-07-08 12:46:20,428 INFO L263 TraceCheckUtils]: 36: Hoare triple {2233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2233#false} is VALID [2020-07-08 12:46:20,428 INFO L280 TraceCheckUtils]: 37: Hoare triple {2233#false} ~cond := #in~cond; {2233#false} is VALID [2020-07-08 12:46:20,428 INFO L280 TraceCheckUtils]: 38: Hoare triple {2233#false} assume 0 == ~cond; {2233#false} is VALID [2020-07-08 12:46:20,428 INFO L280 TraceCheckUtils]: 39: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2020-07-08 12:46:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:20,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:20,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-08 12:46:20,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368931618] [2020-07-08 12:46:20,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-08 12:46:20,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:20,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:20,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:20,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:20,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:20,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:20,494 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 7 states. [2020-07-08 12:46:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:20,841 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-07-08 12:46:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:20,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-08 12:46:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-08 12:46:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-08 12:46:20,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-08 12:46:20,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:20,974 INFO L225 Difference]: With dead ends: 116 [2020-07-08 12:46:20,974 INFO L226 Difference]: Without dead ends: 65 [2020-07-08 12:46:20,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-08 12:46:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-07-08 12:46:21,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:21,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2020-07-08 12:46:21,001 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2020-07-08 12:46:21,002 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2020-07-08 12:46:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:21,004 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-07-08 12:46:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-07-08 12:46:21,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:21,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:21,005 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2020-07-08 12:46:21,005 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2020-07-08 12:46:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:21,008 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-07-08 12:46:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-07-08 12:46:21,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:21,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:21,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:21,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-08 12:46:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-07-08 12:46:21,012 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 40 [2020-07-08 12:46:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:21,012 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-07-08 12:46:21,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2020-07-08 12:46:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 12:46:21,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:21,013 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:21,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-08 12:46:21,227 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 34367350, now seen corresponding path program 2 times [2020-07-08 12:46:21,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:21,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577779749] [2020-07-08 12:46:21,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:21,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-08 12:46:21,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-08 12:46:21,324 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-08 12:46:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:21,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {2723#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2723#true} is VALID [2020-07-08 12:46:21,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-08 12:46:21,332 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2723#true} {2724#false} #147#return; {2724#false} is VALID [2020-07-08 12:46:21,333 INFO L263 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:21,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-08 12:46:21,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-08 12:46:21,334 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-08 12:46:21,334 INFO L263 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret23 := main(); {2723#true} is VALID [2020-07-08 12:46:21,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2728#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:21,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2728#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:21,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {2728#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2729#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:21,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {2729#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2729#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:21,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {2729#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2730#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:21,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2730#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:21,339 INFO L280 TraceCheckUtils]: 11: Hoare triple {2730#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2731#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:21,339 INFO L280 TraceCheckUtils]: 12: Hoare triple {2731#(<= main_~i~1 3)} assume !(~i~1 < 8); {2724#false} is VALID [2020-07-08 12:46:21,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {2724#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2724#false} is VALID [2020-07-08 12:46:21,340 INFO L263 TraceCheckUtils]: 14: Hoare triple {2724#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2724#false} is VALID [2020-07-08 12:46:21,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {2724#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); {2724#false} is VALID [2020-07-08 12:46:21,340 INFO L280 TraceCheckUtils]: 16: Hoare triple {2724#false} assume !(~str.base == 0 && ~str.offset == 0); {2724#false} is VALID [2020-07-08 12:46:21,340 INFO L280 TraceCheckUtils]: 17: Hoare triple {2724#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2724#false} is VALID [2020-07-08 12:46:21,340 INFO L280 TraceCheckUtils]: 18: Hoare triple {2724#false} assume #t~switch4; {2724#false} is VALID [2020-07-08 12:46:21,341 INFO L280 TraceCheckUtils]: 19: Hoare triple {2724#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2724#false} is VALID [2020-07-08 12:46:21,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {2724#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2724#false} is VALID [2020-07-08 12:46:21,341 INFO L280 TraceCheckUtils]: 21: Hoare triple {2724#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {2724#false} is VALID [2020-07-08 12:46:21,342 INFO L280 TraceCheckUtils]: 22: Hoare triple {2724#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2724#false} is VALID [2020-07-08 12:46:21,343 INFO L280 TraceCheckUtils]: 23: Hoare triple {2724#false} assume !(34 == #t~mem9);havoc #t~mem9; {2724#false} is VALID [2020-07-08 12:46:21,343 INFO L280 TraceCheckUtils]: 24: Hoare triple {2724#false} ~j~0 := ~i~0 - 1; {2724#false} is VALID [2020-07-08 12:46:21,343 INFO L280 TraceCheckUtils]: 25: Hoare triple {2724#false} #t~short14 := 0 < ~j~0; {2724#false} is VALID [2020-07-08 12:46:21,343 INFO L280 TraceCheckUtils]: 26: Hoare triple {2724#false} assume !#t~short14; {2724#false} is VALID [2020-07-08 12:46:21,343 INFO L280 TraceCheckUtils]: 27: Hoare triple {2724#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {2724#false} is VALID [2020-07-08 12:46:21,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {2724#false} #t~short17 := 0 < ~j~0; {2724#false} is VALID [2020-07-08 12:46:21,344 INFO L280 TraceCheckUtils]: 29: Hoare triple {2724#false} assume !#t~short17; {2724#false} is VALID [2020-07-08 12:46:21,344 INFO L280 TraceCheckUtils]: 30: Hoare triple {2724#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2724#false} is VALID [2020-07-08 12:46:21,344 INFO L280 TraceCheckUtils]: 31: Hoare triple {2724#false} assume ~start~0 <= ~j~0; {2724#false} is VALID [2020-07-08 12:46:21,344 INFO L280 TraceCheckUtils]: 32: Hoare triple {2724#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2724#false} is VALID [2020-07-08 12:46:21,345 INFO L263 TraceCheckUtils]: 33: Hoare triple {2724#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2723#true} is VALID [2020-07-08 12:46:21,345 INFO L280 TraceCheckUtils]: 34: Hoare triple {2723#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2723#true} is VALID [2020-07-08 12:46:21,345 INFO L280 TraceCheckUtils]: 35: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-08 12:46:21,345 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2723#true} {2724#false} #147#return; {2724#false} is VALID [2020-07-08 12:46:21,345 INFO L280 TraceCheckUtils]: 37: Hoare triple {2724#false} havoc #t~ret19.base, #t~ret19.offset; {2724#false} is VALID [2020-07-08 12:46:21,346 INFO L263 TraceCheckUtils]: 38: Hoare triple {2724#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2724#false} is VALID [2020-07-08 12:46:21,346 INFO L280 TraceCheckUtils]: 39: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2020-07-08 12:46:21,346 INFO L280 TraceCheckUtils]: 40: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2020-07-08 12:46:21,346 INFO L280 TraceCheckUtils]: 41: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2020-07-08 12:46:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:21,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577779749] [2020-07-08 12:46:21,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317012717] [2020-07-08 12:46:21,350 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:21,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:46:21,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:21,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:46:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:21,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:21,558 INFO L263 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2723#true} is VALID [2020-07-08 12:46:21,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-08 12:46:21,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-08 12:46:21,559 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-08 12:46:21,559 INFO L263 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret23 := main(); {2723#true} is VALID [2020-07-08 12:46:21,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2723#true} is VALID [2020-07-08 12:46:21,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-08 12:46:21,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-08 12:46:21,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-08 12:46:21,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-08 12:46:21,560 INFO L280 TraceCheckUtils]: 10: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-08 12:46:21,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-08 12:46:21,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {2723#true} assume !(~i~1 < 8); {2723#true} is VALID [2020-07-08 12:46:21,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {2723#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2723#true} is VALID [2020-07-08 12:46:21,561 INFO L263 TraceCheckUtils]: 14: Hoare triple {2723#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2723#true} is VALID [2020-07-08 12:46:21,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {2723#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); {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 12:46:21,564 INFO L280 TraceCheckUtils]: 16: Hoare triple {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-08 12:46:21,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,575 INFO L280 TraceCheckUtils]: 20: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,576 INFO L280 TraceCheckUtils]: 21: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,576 INFO L280 TraceCheckUtils]: 22: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,577 INFO L280 TraceCheckUtils]: 23: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem9);havoc #t~mem9; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-08 12:46:21,577 INFO L280 TraceCheckUtils]: 24: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,579 INFO L280 TraceCheckUtils]: 27: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,580 INFO L280 TraceCheckUtils]: 28: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,581 INFO L280 TraceCheckUtils]: 29: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,582 INFO L280 TraceCheckUtils]: 30: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-08 12:46:21,583 INFO L280 TraceCheckUtils]: 31: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {2724#false} is VALID [2020-07-08 12:46:21,583 INFO L280 TraceCheckUtils]: 32: Hoare triple {2724#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2724#false} is VALID [2020-07-08 12:46:21,583 INFO L263 TraceCheckUtils]: 33: Hoare triple {2724#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2724#false} is VALID [2020-07-08 12:46:21,584 INFO L280 TraceCheckUtils]: 34: Hoare triple {2724#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2724#false} is VALID [2020-07-08 12:46:21,584 INFO L280 TraceCheckUtils]: 35: Hoare triple {2724#false} assume true; {2724#false} is VALID [2020-07-08 12:46:21,584 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2724#false} {2724#false} #147#return; {2724#false} is VALID [2020-07-08 12:46:21,584 INFO L280 TraceCheckUtils]: 37: Hoare triple {2724#false} havoc #t~ret19.base, #t~ret19.offset; {2724#false} is VALID [2020-07-08 12:46:21,584 INFO L263 TraceCheckUtils]: 38: Hoare triple {2724#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2724#false} is VALID [2020-07-08 12:46:21,584 INFO L280 TraceCheckUtils]: 39: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2020-07-08 12:46:21,585 INFO L280 TraceCheckUtils]: 40: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2020-07-08 12:46:21,585 INFO L280 TraceCheckUtils]: 41: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2020-07-08 12:46:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-08 12:46:21,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:21,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-07-08 12:46:21,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559495559] [2020-07-08 12:46:21,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-07-08 12:46:21,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:21,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:21,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:21,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:21,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:21,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:46:21,643 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2020-07-08 12:46:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:22,037 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2020-07-08 12:46:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:22,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-07-08 12:46:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2020-07-08 12:46:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2020-07-08 12:46:22,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 143 transitions. [2020-07-08 12:46:22,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:22,217 INFO L225 Difference]: With dead ends: 134 [2020-07-08 12:46:22,217 INFO L226 Difference]: Without dead ends: 75 [2020-07-08 12:46:22,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:46:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-08 12:46:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-07-08 12:46:22,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:22,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 59 states. [2020-07-08 12:46:22,245 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 59 states. [2020-07-08 12:46:22,245 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 59 states. [2020-07-08 12:46:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:22,248 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-07-08 12:46:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2020-07-08 12:46:22,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:22,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:22,249 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 75 states. [2020-07-08 12:46:22,249 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 75 states. [2020-07-08 12:46:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:22,252 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-07-08 12:46:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2020-07-08 12:46:22,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:22,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:22,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:22,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 12:46:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2020-07-08 12:46:22,256 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 42 [2020-07-08 12:46:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:22,256 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2020-07-08 12:46:22,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-07-08 12:46:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-08 12:46:22,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:22,257 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-07-08 12:46:22,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:22,466 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -615754617, now seen corresponding path program 1 times [2020-07-08 12:46:22,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:22,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985037369] [2020-07-08 12:46:22,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:22,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-08 12:46:22,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-08 12:46:22,552 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-08 12:46:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:22,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {3259#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3259#true} is VALID [2020-07-08 12:46:22,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-08 12:46:22,557 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3259#true} {3260#false} #147#return; {3260#false} is VALID [2020-07-08 12:46:22,558 INFO L263 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:22,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-08 12:46:22,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-08 12:46:22,559 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-08 12:46:22,559 INFO L263 TraceCheckUtils]: 4: Hoare triple {3259#true} call #t~ret23 := main(); {3259#true} is VALID [2020-07-08 12:46:22,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {3259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3264#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:22,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {3264#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3264#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:22,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {3264#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3265#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:22,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {3265#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3265#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:22,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {3265#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3266#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:22,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3266#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:22,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {3266#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3267#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:22,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {3267#(<= main_~i~1 3)} assume !(~i~1 < 8); {3260#false} is VALID [2020-07-08 12:46:22,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3260#false} is VALID [2020-07-08 12:46:22,565 INFO L263 TraceCheckUtils]: 14: Hoare triple {3260#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3260#false} is VALID [2020-07-08 12:46:22,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#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); {3260#false} is VALID [2020-07-08 12:46:22,566 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#false} assume !(~str.base == 0 && ~str.offset == 0); {3260#false} is VALID [2020-07-08 12:46:22,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-08 12:46:22,566 INFO L280 TraceCheckUtils]: 18: Hoare triple {3260#false} assume !#t~switch4; {3260#false} is VALID [2020-07-08 12:46:22,566 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#false} havoc #t~switch4;havoc #t~mem3; {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 21: Hoare triple {3260#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 22: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 23: Hoare triple {3260#false} assume #t~switch4; {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3260#false} is VALID [2020-07-08 12:46:22,567 INFO L280 TraceCheckUtils]: 26: Hoare triple {3260#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 27: Hoare triple {3260#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 28: Hoare triple {3260#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 29: Hoare triple {3260#false} ~j~0 := ~i~0 - 1; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 30: Hoare triple {3260#false} #t~short14 := 0 < ~j~0; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 31: Hoare triple {3260#false} assume !#t~short14; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 32: Hoare triple {3260#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 33: Hoare triple {3260#false} #t~short17 := 0 < ~j~0; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 34: Hoare triple {3260#false} assume !#t~short17; {3260#false} is VALID [2020-07-08 12:46:22,568 INFO L280 TraceCheckUtils]: 35: Hoare triple {3260#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3260#false} is VALID [2020-07-08 12:46:22,569 INFO L280 TraceCheckUtils]: 36: Hoare triple {3260#false} assume ~start~0 <= ~j~0; {3260#false} is VALID [2020-07-08 12:46:22,569 INFO L280 TraceCheckUtils]: 37: Hoare triple {3260#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3260#false} is VALID [2020-07-08 12:46:22,569 INFO L263 TraceCheckUtils]: 38: Hoare triple {3260#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3259#true} is VALID [2020-07-08 12:46:22,569 INFO L280 TraceCheckUtils]: 39: Hoare triple {3259#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3259#true} is VALID [2020-07-08 12:46:22,569 INFO L280 TraceCheckUtils]: 40: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-08 12:46:22,570 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3259#true} {3260#false} #147#return; {3260#false} is VALID [2020-07-08 12:46:22,570 INFO L280 TraceCheckUtils]: 42: Hoare triple {3260#false} havoc #t~ret19.base, #t~ret19.offset; {3260#false} is VALID [2020-07-08 12:46:22,570 INFO L263 TraceCheckUtils]: 43: Hoare triple {3260#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3260#false} is VALID [2020-07-08 12:46:22,570 INFO L280 TraceCheckUtils]: 44: Hoare triple {3260#false} ~cond := #in~cond; {3260#false} is VALID [2020-07-08 12:46:22,570 INFO L280 TraceCheckUtils]: 45: Hoare triple {3260#false} assume 0 == ~cond; {3260#false} is VALID [2020-07-08 12:46:22,571 INFO L280 TraceCheckUtils]: 46: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2020-07-08 12:46:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:22,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985037369] [2020-07-08 12:46:22,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269725804] [2020-07-08 12:46:22,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:22,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:46:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:22,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:22,726 INFO L263 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3259#true} is VALID [2020-07-08 12:46:22,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-08 12:46:22,726 INFO L280 TraceCheckUtils]: 2: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-08 12:46:22,726 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-08 12:46:22,726 INFO L263 TraceCheckUtils]: 4: Hoare triple {3259#true} call #t~ret23 := main(); {3259#true} is VALID [2020-07-08 12:46:22,727 INFO L280 TraceCheckUtils]: 5: Hoare triple {3259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3290#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:22,727 INFO L280 TraceCheckUtils]: 6: Hoare triple {3290#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3290#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:22,728 INFO L280 TraceCheckUtils]: 7: Hoare triple {3290#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3265#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:22,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {3265#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3265#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:22,729 INFO L280 TraceCheckUtils]: 9: Hoare triple {3265#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3266#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:22,729 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3266#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:22,730 INFO L280 TraceCheckUtils]: 11: Hoare triple {3266#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3267#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:22,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {3267#(<= main_~i~1 3)} assume !(~i~1 < 8); {3260#false} is VALID [2020-07-08 12:46:22,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3260#false} is VALID [2020-07-08 12:46:22,732 INFO L263 TraceCheckUtils]: 14: Hoare triple {3260#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3260#false} is VALID [2020-07-08 12:46:22,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#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); {3260#false} is VALID [2020-07-08 12:46:22,732 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#false} assume !(~str.base == 0 && ~str.offset == 0); {3260#false} is VALID [2020-07-08 12:46:22,732 INFO L280 TraceCheckUtils]: 17: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-08 12:46:22,732 INFO L280 TraceCheckUtils]: 18: Hoare triple {3260#false} assume !#t~switch4; {3260#false} is VALID [2020-07-08 12:46:22,733 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#false} havoc #t~switch4;havoc #t~mem3; {3260#false} is VALID [2020-07-08 12:46:22,733 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3260#false} is VALID [2020-07-08 12:46:22,733 INFO L280 TraceCheckUtils]: 21: Hoare triple {3260#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3260#false} is VALID [2020-07-08 12:46:22,733 INFO L280 TraceCheckUtils]: 22: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-08 12:46:22,733 INFO L280 TraceCheckUtils]: 23: Hoare triple {3260#false} assume #t~switch4; {3260#false} is VALID [2020-07-08 12:46:22,733 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3260#false} is VALID [2020-07-08 12:46:22,734 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3260#false} is VALID [2020-07-08 12:46:22,734 INFO L280 TraceCheckUtils]: 26: Hoare triple {3260#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {3260#false} is VALID [2020-07-08 12:46:22,734 INFO L280 TraceCheckUtils]: 27: Hoare triple {3260#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3260#false} is VALID [2020-07-08 12:46:22,734 INFO L280 TraceCheckUtils]: 28: Hoare triple {3260#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3260#false} is VALID [2020-07-08 12:46:22,734 INFO L280 TraceCheckUtils]: 29: Hoare triple {3260#false} ~j~0 := ~i~0 - 1; {3260#false} is VALID [2020-07-08 12:46:22,734 INFO L280 TraceCheckUtils]: 30: Hoare triple {3260#false} #t~short14 := 0 < ~j~0; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 31: Hoare triple {3260#false} assume !#t~short14; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 32: Hoare triple {3260#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 33: Hoare triple {3260#false} #t~short17 := 0 < ~j~0; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 34: Hoare triple {3260#false} assume !#t~short17; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 35: Hoare triple {3260#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 36: Hoare triple {3260#false} assume ~start~0 <= ~j~0; {3260#false} is VALID [2020-07-08 12:46:22,735 INFO L280 TraceCheckUtils]: 37: Hoare triple {3260#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L263 TraceCheckUtils]: 38: Hoare triple {3260#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L280 TraceCheckUtils]: 39: Hoare triple {3260#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L280 TraceCheckUtils]: 40: Hoare triple {3260#false} assume true; {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3260#false} {3260#false} #147#return; {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L280 TraceCheckUtils]: 42: Hoare triple {3260#false} havoc #t~ret19.base, #t~ret19.offset; {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L263 TraceCheckUtils]: 43: Hoare triple {3260#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L280 TraceCheckUtils]: 44: Hoare triple {3260#false} ~cond := #in~cond; {3260#false} is VALID [2020-07-08 12:46:22,736 INFO L280 TraceCheckUtils]: 45: Hoare triple {3260#false} assume 0 == ~cond; {3260#false} is VALID [2020-07-08 12:46:22,737 INFO L280 TraceCheckUtils]: 46: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2020-07-08 12:46:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:22,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:22,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-08 12:46:22,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037215806] [2020-07-08 12:46:22,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-08 12:46:22,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:22,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:46:22,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:22,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:46:22,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:22,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:46:22,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:22,806 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 8 states. [2020-07-08 12:46:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:23,219 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2020-07-08 12:46:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:23,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-08 12:46:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:46:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-08 12:46:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:46:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-08 12:46:23,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-08 12:46:23,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:23,338 INFO L225 Difference]: With dead ends: 108 [2020-07-08 12:46:23,338 INFO L226 Difference]: Without dead ends: 62 [2020-07-08 12:46:23,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-08 12:46:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-07-08 12:46:23,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:23,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2020-07-08 12:46:23,362 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2020-07-08 12:46:23,362 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2020-07-08 12:46:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:23,364 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-08 12:46:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-08 12:46:23,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:23,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:23,365 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2020-07-08 12:46:23,365 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2020-07-08 12:46:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:23,367 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-08 12:46:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-08 12:46:23,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:23,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:23,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:23,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 12:46:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2020-07-08 12:46:23,370 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 47 [2020-07-08 12:46:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:23,371 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2020-07-08 12:46:23,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:46:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2020-07-08 12:46:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 12:46:23,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:23,372 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:23,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:23,586 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash -900340667, now seen corresponding path program 2 times [2020-07-08 12:46:23,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:23,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648718969] [2020-07-08 12:46:23,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:23,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-08 12:46:23,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-08 12:46:23,686 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-08 12:46:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:23,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {3754#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3754#true} is VALID [2020-07-08 12:46:23,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-08 12:46:23,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3754#true} {3755#false} #147#return; {3755#false} is VALID [2020-07-08 12:46:23,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:23,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-08 12:46:23,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-08 12:46:23,706 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-08 12:46:23,706 INFO L263 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret23 := main(); {3754#true} is VALID [2020-07-08 12:46:23,706 INFO L280 TraceCheckUtils]: 5: Hoare triple {3754#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3759#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:23,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {3759#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3759#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:23,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {3759#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3760#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:23,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3760#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:23,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3761#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:23,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3761#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:23,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {3761#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3762#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:23,716 INFO L280 TraceCheckUtils]: 12: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3762#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:23,716 INFO L280 TraceCheckUtils]: 13: Hoare triple {3762#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3763#(<= main_~i~1 4)} is VALID [2020-07-08 12:46:23,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~i~1 4)} assume !(~i~1 < 8); {3755#false} is VALID [2020-07-08 12:46:23,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {3755#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3755#false} is VALID [2020-07-08 12:46:23,717 INFO L263 TraceCheckUtils]: 16: Hoare triple {3755#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3755#false} is VALID [2020-07-08 12:46:23,717 INFO L280 TraceCheckUtils]: 17: Hoare triple {3755#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); {3755#false} is VALID [2020-07-08 12:46:23,718 INFO L280 TraceCheckUtils]: 18: Hoare triple {3755#false} assume !(~str.base == 0 && ~str.offset == 0); {3755#false} is VALID [2020-07-08 12:46:23,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {3755#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3755#false} is VALID [2020-07-08 12:46:23,718 INFO L280 TraceCheckUtils]: 20: Hoare triple {3755#false} assume !#t~switch4; {3755#false} is VALID [2020-07-08 12:46:23,718 INFO L280 TraceCheckUtils]: 21: Hoare triple {3755#false} havoc #t~switch4;havoc #t~mem3; {3755#false} is VALID [2020-07-08 12:46:23,718 INFO L280 TraceCheckUtils]: 22: Hoare triple {3755#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3755#false} is VALID [2020-07-08 12:46:23,719 INFO L280 TraceCheckUtils]: 23: Hoare triple {3755#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3755#false} is VALID [2020-07-08 12:46:23,719 INFO L280 TraceCheckUtils]: 24: Hoare triple {3755#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3755#false} is VALID [2020-07-08 12:46:23,719 INFO L280 TraceCheckUtils]: 25: Hoare triple {3755#false} assume #t~switch4; {3755#false} is VALID [2020-07-08 12:46:23,719 INFO L280 TraceCheckUtils]: 26: Hoare triple {3755#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3755#false} is VALID [2020-07-08 12:46:23,719 INFO L280 TraceCheckUtils]: 27: Hoare triple {3755#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3755#false} is VALID [2020-07-08 12:46:23,720 INFO L280 TraceCheckUtils]: 28: Hoare triple {3755#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {3755#false} is VALID [2020-07-08 12:46:23,720 INFO L280 TraceCheckUtils]: 29: Hoare triple {3755#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3755#false} is VALID [2020-07-08 12:46:23,720 INFO L280 TraceCheckUtils]: 30: Hoare triple {3755#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3755#false} is VALID [2020-07-08 12:46:23,720 INFO L280 TraceCheckUtils]: 31: Hoare triple {3755#false} ~j~0 := ~i~0 - 1; {3755#false} is VALID [2020-07-08 12:46:23,720 INFO L280 TraceCheckUtils]: 32: Hoare triple {3755#false} #t~short14 := 0 < ~j~0; {3755#false} is VALID [2020-07-08 12:46:23,721 INFO L280 TraceCheckUtils]: 33: Hoare triple {3755#false} assume !#t~short14; {3755#false} is VALID [2020-07-08 12:46:23,721 INFO L280 TraceCheckUtils]: 34: Hoare triple {3755#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {3755#false} is VALID [2020-07-08 12:46:23,721 INFO L280 TraceCheckUtils]: 35: Hoare triple {3755#false} #t~short17 := 0 < ~j~0; {3755#false} is VALID [2020-07-08 12:46:23,721 INFO L280 TraceCheckUtils]: 36: Hoare triple {3755#false} assume !#t~short17; {3755#false} is VALID [2020-07-08 12:46:23,721 INFO L280 TraceCheckUtils]: 37: Hoare triple {3755#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3755#false} is VALID [2020-07-08 12:46:23,722 INFO L280 TraceCheckUtils]: 38: Hoare triple {3755#false} assume ~start~0 <= ~j~0; {3755#false} is VALID [2020-07-08 12:46:23,722 INFO L280 TraceCheckUtils]: 39: Hoare triple {3755#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3755#false} is VALID [2020-07-08 12:46:23,722 INFO L263 TraceCheckUtils]: 40: Hoare triple {3755#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3754#true} is VALID [2020-07-08 12:46:23,722 INFO L280 TraceCheckUtils]: 41: Hoare triple {3754#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3754#true} is VALID [2020-07-08 12:46:23,722 INFO L280 TraceCheckUtils]: 42: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-08 12:46:23,722 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3754#true} {3755#false} #147#return; {3755#false} is VALID [2020-07-08 12:46:23,723 INFO L280 TraceCheckUtils]: 44: Hoare triple {3755#false} havoc #t~ret19.base, #t~ret19.offset; {3755#false} is VALID [2020-07-08 12:46:23,723 INFO L263 TraceCheckUtils]: 45: Hoare triple {3755#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3755#false} is VALID [2020-07-08 12:46:23,723 INFO L280 TraceCheckUtils]: 46: Hoare triple {3755#false} ~cond := #in~cond; {3755#false} is VALID [2020-07-08 12:46:23,723 INFO L280 TraceCheckUtils]: 47: Hoare triple {3755#false} assume 0 == ~cond; {3755#false} is VALID [2020-07-08 12:46:23,723 INFO L280 TraceCheckUtils]: 48: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2020-07-08 12:46:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:23,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648718969] [2020-07-08 12:46:23,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040858812] [2020-07-08 12:46:23,726 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:23,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:46:23,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:23,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:46:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:23,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:23,878 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:23,919 INFO L263 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L263 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret23 := main(); {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {3754#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-08 12:46:23,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 11: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 12: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 13: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 14: Hoare triple {3754#true} assume !(~i~1 < 8); {3754#true} is VALID [2020-07-08 12:46:23,921 INFO L280 TraceCheckUtils]: 15: Hoare triple {3754#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3754#true} is VALID [2020-07-08 12:46:23,922 INFO L263 TraceCheckUtils]: 16: Hoare triple {3754#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3754#true} is VALID [2020-07-08 12:46:23,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {3754#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); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,923 INFO L280 TraceCheckUtils]: 20: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} havoc #t~switch4;havoc #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,924 INFO L280 TraceCheckUtils]: 22: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,924 INFO L280 TraceCheckUtils]: 23: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem1);havoc #t~mem1; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,925 INFO L280 TraceCheckUtils]: 24: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,925 INFO L280 TraceCheckUtils]: 25: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume #t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,925 INFO L280 TraceCheckUtils]: 26: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,926 INFO L280 TraceCheckUtils]: 28: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,927 INFO L280 TraceCheckUtils]: 29: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,927 INFO L280 TraceCheckUtils]: 30: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3862#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,928 INFO L280 TraceCheckUtils]: 31: Hoare triple {3862#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {3862#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-08 12:46:23,928 INFO L280 TraceCheckUtils]: 32: Hoare triple {3862#(<= 1 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {3869#(and (<= 1 parse_expression_list_~start~0) (or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|)))} is VALID [2020-07-08 12:46:23,929 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#(and (<= 1 parse_expression_list_~start~0) (or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|)))} assume !#t~short14; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 12:46:23,929 INFO L280 TraceCheckUtils]: 34: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 12:46:23,930 INFO L280 TraceCheckUtils]: 35: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 12:46:23,930 INFO L280 TraceCheckUtils]: 36: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 12:46:23,931 INFO L280 TraceCheckUtils]: 37: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-08 12:46:23,931 INFO L280 TraceCheckUtils]: 38: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {3755#false} is VALID [2020-07-08 12:46:23,932 INFO L280 TraceCheckUtils]: 39: Hoare triple {3755#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3755#false} is VALID [2020-07-08 12:46:23,932 INFO L263 TraceCheckUtils]: 40: Hoare triple {3755#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3755#false} is VALID [2020-07-08 12:46:23,932 INFO L280 TraceCheckUtils]: 41: Hoare triple {3755#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3755#false} is VALID [2020-07-08 12:46:23,932 INFO L280 TraceCheckUtils]: 42: Hoare triple {3755#false} assume true; {3755#false} is VALID [2020-07-08 12:46:23,932 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3755#false} {3755#false} #147#return; {3755#false} is VALID [2020-07-08 12:46:23,933 INFO L280 TraceCheckUtils]: 44: Hoare triple {3755#false} havoc #t~ret19.base, #t~ret19.offset; {3755#false} is VALID [2020-07-08 12:46:23,933 INFO L263 TraceCheckUtils]: 45: Hoare triple {3755#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3755#false} is VALID [2020-07-08 12:46:23,933 INFO L280 TraceCheckUtils]: 46: Hoare triple {3755#false} ~cond := #in~cond; {3755#false} is VALID [2020-07-08 12:46:23,933 INFO L280 TraceCheckUtils]: 47: Hoare triple {3755#false} assume 0 == ~cond; {3755#false} is VALID [2020-07-08 12:46:23,933 INFO L280 TraceCheckUtils]: 48: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2020-07-08 12:46:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-08 12:46:23,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:23,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2020-07-08 12:46:23,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508512760] [2020-07-08 12:46:23,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-08 12:46:23,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:23,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:23,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:23,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:46:23,989 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2020-07-08 12:46:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:24,487 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2020-07-08 12:46:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:24,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-08 12:46:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2020-07-08 12:46:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2020-07-08 12:46:24,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 174 transitions. [2020-07-08 12:46:24,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:24,710 INFO L225 Difference]: With dead ends: 160 [2020-07-08 12:46:24,710 INFO L226 Difference]: Without dead ends: 115 [2020-07-08 12:46:24,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:46:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-08 12:46:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2020-07-08 12:46:24,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:24,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 83 states. [2020-07-08 12:46:24,753 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 83 states. [2020-07-08 12:46:24,753 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 83 states. [2020-07-08 12:46:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:24,759 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2020-07-08 12:46:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2020-07-08 12:46:24,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:24,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:24,760 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 115 states. [2020-07-08 12:46:24,760 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 115 states. [2020-07-08 12:46:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:24,765 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2020-07-08 12:46:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2020-07-08 12:46:24,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:24,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:24,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:24,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-08 12:46:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2020-07-08 12:46:24,769 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 49 [2020-07-08 12:46:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:24,770 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2020-07-08 12:46:24,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2020-07-08 12:46:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 12:46:24,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:24,771 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:24,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-08 12:46:24,983 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1705682887, now seen corresponding path program 1 times [2020-07-08 12:46:24,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:24,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705621157] [2020-07-08 12:46:24,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:25,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-08 12:46:25,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-08 12:46:25,079 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-08 12:46:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:25,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {4451#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4451#true} is VALID [2020-07-08 12:46:25,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-08 12:46:25,083 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4452#false} #147#return; {4452#false} is VALID [2020-07-08 12:46:25,083 INFO L263 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:25,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-08 12:46:25,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-08 12:46:25,084 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-08 12:46:25,084 INFO L263 TraceCheckUtils]: 4: Hoare triple {4451#true} call #t~ret23 := main(); {4451#true} is VALID [2020-07-08 12:46:25,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {4451#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {4456#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:25,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {4456#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4456#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:25,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {4456#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4457#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:25,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {4457#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4457#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:25,088 INFO L280 TraceCheckUtils]: 9: Hoare triple {4457#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4458#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:25,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {4458#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4458#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:25,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {4458#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4459#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:25,089 INFO L280 TraceCheckUtils]: 12: Hoare triple {4459#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4459#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:25,090 INFO L280 TraceCheckUtils]: 13: Hoare triple {4459#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4460#(<= main_~i~1 4)} is VALID [2020-07-08 12:46:25,091 INFO L280 TraceCheckUtils]: 14: Hoare triple {4460#(<= main_~i~1 4)} assume !(~i~1 < 8); {4452#false} is VALID [2020-07-08 12:46:25,091 INFO L280 TraceCheckUtils]: 15: Hoare triple {4452#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4452#false} is VALID [2020-07-08 12:46:25,091 INFO L263 TraceCheckUtils]: 16: Hoare triple {4452#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4452#false} is VALID [2020-07-08 12:46:25,092 INFO L280 TraceCheckUtils]: 17: Hoare triple {4452#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); {4452#false} is VALID [2020-07-08 12:46:25,092 INFO L280 TraceCheckUtils]: 18: Hoare triple {4452#false} assume !(~str.base == 0 && ~str.offset == 0); {4452#false} is VALID [2020-07-08 12:46:25,092 INFO L280 TraceCheckUtils]: 19: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-08 12:46:25,092 INFO L280 TraceCheckUtils]: 20: Hoare triple {4452#false} assume !#t~switch4; {4452#false} is VALID [2020-07-08 12:46:25,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {4452#false} havoc #t~switch4;havoc #t~mem3; {4452#false} is VALID [2020-07-08 12:46:25,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {4452#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4452#false} is VALID [2020-07-08 12:46:25,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {4452#false} assume !!(0 != #t~mem1);havoc #t~mem1; {4452#false} is VALID [2020-07-08 12:46:25,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-08 12:46:25,094 INFO L280 TraceCheckUtils]: 25: Hoare triple {4452#false} assume #t~switch4; {4452#false} is VALID [2020-07-08 12:46:25,094 INFO L280 TraceCheckUtils]: 26: Hoare triple {4452#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4452#false} is VALID [2020-07-08 12:46:25,094 INFO L280 TraceCheckUtils]: 27: Hoare triple {4452#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4452#false} is VALID [2020-07-08 12:46:25,094 INFO L280 TraceCheckUtils]: 28: Hoare triple {4452#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {4452#false} is VALID [2020-07-08 12:46:25,095 INFO L280 TraceCheckUtils]: 29: Hoare triple {4452#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4452#false} is VALID [2020-07-08 12:46:25,095 INFO L280 TraceCheckUtils]: 30: Hoare triple {4452#false} assume !(34 == #t~mem9);havoc #t~mem9; {4452#false} is VALID [2020-07-08 12:46:25,095 INFO L280 TraceCheckUtils]: 31: Hoare triple {4452#false} ~j~0 := ~i~0 - 1; {4452#false} is VALID [2020-07-08 12:46:25,095 INFO L280 TraceCheckUtils]: 32: Hoare triple {4452#false} #t~short14 := 0 < ~j~0; {4452#false} is VALID [2020-07-08 12:46:25,096 INFO L280 TraceCheckUtils]: 33: Hoare triple {4452#false} assume !#t~short14; {4452#false} is VALID [2020-07-08 12:46:25,096 INFO L280 TraceCheckUtils]: 34: Hoare triple {4452#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {4452#false} is VALID [2020-07-08 12:46:25,096 INFO L280 TraceCheckUtils]: 35: Hoare triple {4452#false} #t~short17 := 0 < ~j~0; {4452#false} is VALID [2020-07-08 12:46:25,096 INFO L280 TraceCheckUtils]: 36: Hoare triple {4452#false} assume !#t~short17; {4452#false} is VALID [2020-07-08 12:46:25,097 INFO L280 TraceCheckUtils]: 37: Hoare triple {4452#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {4452#false} is VALID [2020-07-08 12:46:25,097 INFO L280 TraceCheckUtils]: 38: Hoare triple {4452#false} assume ~start~0 <= ~j~0; {4452#false} is VALID [2020-07-08 12:46:25,097 INFO L280 TraceCheckUtils]: 39: Hoare triple {4452#false} assume !(1 + (~j~0 - ~start~0) >= 2); {4452#false} is VALID [2020-07-08 12:46:25,097 INFO L263 TraceCheckUtils]: 40: Hoare triple {4452#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {4451#true} is VALID [2020-07-08 12:46:25,098 INFO L280 TraceCheckUtils]: 41: Hoare triple {4451#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4451#true} is VALID [2020-07-08 12:46:25,098 INFO L280 TraceCheckUtils]: 42: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-08 12:46:25,098 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4451#true} {4452#false} #147#return; {4452#false} is VALID [2020-07-08 12:46:25,098 INFO L280 TraceCheckUtils]: 44: Hoare triple {4452#false} havoc #t~ret19.base, #t~ret19.offset; {4452#false} is VALID [2020-07-08 12:46:25,098 INFO L263 TraceCheckUtils]: 45: Hoare triple {4452#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4452#false} is VALID [2020-07-08 12:46:25,099 INFO L280 TraceCheckUtils]: 46: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2020-07-08 12:46:25,099 INFO L280 TraceCheckUtils]: 47: Hoare triple {4452#false} assume 0 == ~cond; {4452#false} is VALID [2020-07-08 12:46:25,099 INFO L280 TraceCheckUtils]: 48: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2020-07-08 12:46:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:25,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705621157] [2020-07-08 12:46:25,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513565418] [2020-07-08 12:46:25,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:25,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:46:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:25,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:25,285 INFO L263 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4451#true} is VALID [2020-07-08 12:46:25,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-08 12:46:25,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-08 12:46:25,286 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-08 12:46:25,287 INFO L263 TraceCheckUtils]: 4: Hoare triple {4451#true} call #t~ret23 := main(); {4451#true} is VALID [2020-07-08 12:46:25,288 INFO L280 TraceCheckUtils]: 5: Hoare triple {4451#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {4483#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:25,288 INFO L280 TraceCheckUtils]: 6: Hoare triple {4483#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4483#(<= main_~i~1 0)} is VALID [2020-07-08 12:46:25,289 INFO L280 TraceCheckUtils]: 7: Hoare triple {4483#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4457#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:25,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {4457#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4457#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:25,291 INFO L280 TraceCheckUtils]: 9: Hoare triple {4457#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4458#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:25,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {4458#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4458#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:25,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {4458#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4459#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:25,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {4459#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4459#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:25,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {4459#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4460#(<= main_~i~1 4)} is VALID [2020-07-08 12:46:25,295 INFO L280 TraceCheckUtils]: 14: Hoare triple {4460#(<= main_~i~1 4)} assume !(~i~1 < 8); {4452#false} is VALID [2020-07-08 12:46:25,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {4452#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4452#false} is VALID [2020-07-08 12:46:25,296 INFO L263 TraceCheckUtils]: 16: Hoare triple {4452#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4452#false} is VALID [2020-07-08 12:46:25,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {4452#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); {4452#false} is VALID [2020-07-08 12:46:25,296 INFO L280 TraceCheckUtils]: 18: Hoare triple {4452#false} assume !(~str.base == 0 && ~str.offset == 0); {4452#false} is VALID [2020-07-08 12:46:25,296 INFO L280 TraceCheckUtils]: 19: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-08 12:46:25,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {4452#false} assume !#t~switch4; {4452#false} is VALID [2020-07-08 12:46:25,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {4452#false} havoc #t~switch4;havoc #t~mem3; {4452#false} is VALID [2020-07-08 12:46:25,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {4452#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4452#false} is VALID [2020-07-08 12:46:25,297 INFO L280 TraceCheckUtils]: 23: Hoare triple {4452#false} assume !!(0 != #t~mem1);havoc #t~mem1; {4452#false} is VALID [2020-07-08 12:46:25,297 INFO L280 TraceCheckUtils]: 24: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-08 12:46:25,297 INFO L280 TraceCheckUtils]: 25: Hoare triple {4452#false} assume #t~switch4; {4452#false} is VALID [2020-07-08 12:46:25,297 INFO L280 TraceCheckUtils]: 26: Hoare triple {4452#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4452#false} is VALID [2020-07-08 12:46:25,298 INFO L280 TraceCheckUtils]: 27: Hoare triple {4452#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4452#false} is VALID [2020-07-08 12:46:25,298 INFO L280 TraceCheckUtils]: 28: Hoare triple {4452#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {4452#false} is VALID [2020-07-08 12:46:25,298 INFO L280 TraceCheckUtils]: 29: Hoare triple {4452#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4452#false} is VALID [2020-07-08 12:46:25,298 INFO L280 TraceCheckUtils]: 30: Hoare triple {4452#false} assume !(34 == #t~mem9);havoc #t~mem9; {4452#false} is VALID [2020-07-08 12:46:25,298 INFO L280 TraceCheckUtils]: 31: Hoare triple {4452#false} ~j~0 := ~i~0 - 1; {4452#false} is VALID [2020-07-08 12:46:25,298 INFO L280 TraceCheckUtils]: 32: Hoare triple {4452#false} #t~short14 := 0 < ~j~0; {4452#false} is VALID [2020-07-08 12:46:25,299 INFO L280 TraceCheckUtils]: 33: Hoare triple {4452#false} assume !#t~short14; {4452#false} is VALID [2020-07-08 12:46:25,299 INFO L280 TraceCheckUtils]: 34: Hoare triple {4452#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {4452#false} is VALID [2020-07-08 12:46:25,299 INFO L280 TraceCheckUtils]: 35: Hoare triple {4452#false} #t~short17 := 0 < ~j~0; {4452#false} is VALID [2020-07-08 12:46:25,299 INFO L280 TraceCheckUtils]: 36: Hoare triple {4452#false} assume !#t~short17; {4452#false} is VALID [2020-07-08 12:46:25,299 INFO L280 TraceCheckUtils]: 37: Hoare triple {4452#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {4452#false} is VALID [2020-07-08 12:46:25,300 INFO L280 TraceCheckUtils]: 38: Hoare triple {4452#false} assume ~start~0 <= ~j~0; {4452#false} is VALID [2020-07-08 12:46:25,300 INFO L280 TraceCheckUtils]: 39: Hoare triple {4452#false} assume !(1 + (~j~0 - ~start~0) >= 2); {4452#false} is VALID [2020-07-08 12:46:25,300 INFO L263 TraceCheckUtils]: 40: Hoare triple {4452#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {4452#false} is VALID [2020-07-08 12:46:25,301 INFO L280 TraceCheckUtils]: 41: Hoare triple {4452#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4452#false} is VALID [2020-07-08 12:46:25,301 INFO L280 TraceCheckUtils]: 42: Hoare triple {4452#false} assume true; {4452#false} is VALID [2020-07-08 12:46:25,301 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4452#false} {4452#false} #147#return; {4452#false} is VALID [2020-07-08 12:46:25,301 INFO L280 TraceCheckUtils]: 44: Hoare triple {4452#false} havoc #t~ret19.base, #t~ret19.offset; {4452#false} is VALID [2020-07-08 12:46:25,301 INFO L263 TraceCheckUtils]: 45: Hoare triple {4452#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4452#false} is VALID [2020-07-08 12:46:25,302 INFO L280 TraceCheckUtils]: 46: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2020-07-08 12:46:25,302 INFO L280 TraceCheckUtils]: 47: Hoare triple {4452#false} assume 0 == ~cond; {4452#false} is VALID [2020-07-08 12:46:25,302 INFO L280 TraceCheckUtils]: 48: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2020-07-08 12:46:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:25,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:25,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-08 12:46:25,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325176954] [2020-07-08 12:46:25,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-08 12:46:25,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:25,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:46:25,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:25,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:46:25,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:25,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:46:25,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:46:25,380 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 9 states. [2020-07-08 12:46:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:25,828 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2020-07-08 12:46:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:46:25,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-08 12:46:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:46:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2020-07-08 12:46:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:46:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2020-07-08 12:46:25,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2020-07-08 12:46:25,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:25,959 INFO L225 Difference]: With dead ends: 154 [2020-07-08 12:46:25,959 INFO L226 Difference]: Without dead ends: 86 [2020-07-08 12:46:25,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:46:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-08 12:46:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-08 12:46:25,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:25,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-08 12:46:25,995 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-08 12:46:25,995 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-08 12:46:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:25,998 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-08 12:46:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2020-07-08 12:46:25,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:25,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:25,999 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-08 12:46:25,999 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-08 12:46:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:26,001 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-08 12:46:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2020-07-08 12:46:26,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:26,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:26,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:26,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 12:46:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-07-08 12:46:26,004 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 49 [2020-07-08 12:46:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:26,005 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-07-08 12:46:26,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:46:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-07-08 12:46:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 12:46:26,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:26,006 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:26,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:26,220 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1198571515, now seen corresponding path program 2 times [2020-07-08 12:46:26,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:26,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637040356] [2020-07-08 12:46:26,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:26,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-08 12:46:26,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-08 12:46:26,342 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-08 12:46:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:26,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {5085#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-08 12:46:26,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-08 12:46:26,351 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5085#true} {5086#false} #147#return; {5086#false} is VALID [2020-07-08 12:46:26,352 INFO L263 TraceCheckUtils]: 0: Hoare triple {5085#true} call ULTIMATE.init(); {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:46:26,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-08 12:46:26,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-08 12:46:26,353 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-08 12:46:26,353 INFO L263 TraceCheckUtils]: 4: Hoare triple {5085#true} call #t~ret23 := main(); {5085#true} is VALID [2020-07-08 12:46:26,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {5085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {5090#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:26,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {5090#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5090#(= 0 main_~i~1)} is VALID [2020-07-08 12:46:26,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {5090#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5091#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:26,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {5091#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5091#(<= main_~i~1 1)} is VALID [2020-07-08 12:46:26,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {5091#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5092#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:26,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {5092#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5092#(<= main_~i~1 2)} is VALID [2020-07-08 12:46:26,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {5092#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5093#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:26,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {5093#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5093#(<= main_~i~1 3)} is VALID [2020-07-08 12:46:26,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {5093#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5094#(<= main_~i~1 4)} is VALID [2020-07-08 12:46:26,360 INFO L280 TraceCheckUtils]: 14: Hoare triple {5094#(<= main_~i~1 4)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5094#(<= main_~i~1 4)} is VALID [2020-07-08 12:46:26,360 INFO L280 TraceCheckUtils]: 15: Hoare triple {5094#(<= main_~i~1 4)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5095#(<= main_~i~1 5)} is VALID [2020-07-08 12:46:26,361 INFO L280 TraceCheckUtils]: 16: Hoare triple {5095#(<= main_~i~1 5)} assume !(~i~1 < 8); {5086#false} is VALID [2020-07-08 12:46:26,361 INFO L280 TraceCheckUtils]: 17: Hoare triple {5086#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5086#false} is VALID [2020-07-08 12:46:26,362 INFO L263 TraceCheckUtils]: 18: Hoare triple {5086#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5086#false} is VALID [2020-07-08 12:46:26,362 INFO L280 TraceCheckUtils]: 19: Hoare triple {5086#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); {5086#false} is VALID [2020-07-08 12:46:26,362 INFO L280 TraceCheckUtils]: 20: Hoare triple {5086#false} assume !(~str.base == 0 && ~str.offset == 0); {5086#false} is VALID [2020-07-08 12:46:26,362 INFO L280 TraceCheckUtils]: 21: Hoare triple {5086#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5086#false} is VALID [2020-07-08 12:46:26,362 INFO L280 TraceCheckUtils]: 22: Hoare triple {5086#false} assume !#t~switch4; {5086#false} is VALID [2020-07-08 12:46:26,363 INFO L280 TraceCheckUtils]: 23: Hoare triple {5086#false} havoc #t~switch4;havoc #t~mem3; {5086#false} is VALID [2020-07-08 12:46:26,363 INFO L280 TraceCheckUtils]: 24: Hoare triple {5086#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5086#false} is VALID [2020-07-08 12:46:26,363 INFO L280 TraceCheckUtils]: 25: Hoare triple {5086#false} assume !!(0 != #t~mem1);havoc #t~mem1; {5086#false} is VALID [2020-07-08 12:46:26,363 INFO L280 TraceCheckUtils]: 26: Hoare triple {5086#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5086#false} is VALID [2020-07-08 12:46:26,363 INFO L280 TraceCheckUtils]: 27: Hoare triple {5086#false} assume #t~switch4; {5086#false} is VALID [2020-07-08 12:46:26,363 INFO L280 TraceCheckUtils]: 28: Hoare triple {5086#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5086#false} is VALID [2020-07-08 12:46:26,364 INFO L280 TraceCheckUtils]: 29: Hoare triple {5086#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5086#false} is VALID [2020-07-08 12:46:26,364 INFO L280 TraceCheckUtils]: 30: Hoare triple {5086#false} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {5086#false} is VALID [2020-07-08 12:46:26,364 INFO L280 TraceCheckUtils]: 31: Hoare triple {5086#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5086#false} is VALID [2020-07-08 12:46:26,364 INFO L280 TraceCheckUtils]: 32: Hoare triple {5086#false} assume !(34 == #t~mem9);havoc #t~mem9; {5086#false} is VALID [2020-07-08 12:46:26,364 INFO L280 TraceCheckUtils]: 33: Hoare triple {5086#false} ~j~0 := ~i~0 - 1; {5086#false} is VALID [2020-07-08 12:46:26,365 INFO L280 TraceCheckUtils]: 34: Hoare triple {5086#false} #t~short14 := 0 < ~j~0; {5086#false} is VALID [2020-07-08 12:46:26,365 INFO L280 TraceCheckUtils]: 35: Hoare triple {5086#false} assume !#t~short14; {5086#false} is VALID [2020-07-08 12:46:26,365 INFO L280 TraceCheckUtils]: 36: Hoare triple {5086#false} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {5086#false} is VALID [2020-07-08 12:46:26,365 INFO L280 TraceCheckUtils]: 37: Hoare triple {5086#false} #t~short17 := 0 < ~j~0; {5086#false} is VALID [2020-07-08 12:46:26,365 INFO L280 TraceCheckUtils]: 38: Hoare triple {5086#false} assume !#t~short17; {5086#false} is VALID [2020-07-08 12:46:26,365 INFO L280 TraceCheckUtils]: 39: Hoare triple {5086#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {5086#false} is VALID [2020-07-08 12:46:26,366 INFO L280 TraceCheckUtils]: 40: Hoare triple {5086#false} assume ~start~0 <= ~j~0; {5086#false} is VALID [2020-07-08 12:46:26,366 INFO L280 TraceCheckUtils]: 41: Hoare triple {5086#false} assume !(1 + (~j~0 - ~start~0) >= 2); {5086#false} is VALID [2020-07-08 12:46:26,366 INFO L263 TraceCheckUtils]: 42: Hoare triple {5086#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {5085#true} is VALID [2020-07-08 12:46:26,366 INFO L280 TraceCheckUtils]: 43: Hoare triple {5085#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-08 12:46:26,366 INFO L280 TraceCheckUtils]: 44: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-08 12:46:26,366 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5085#true} {5086#false} #147#return; {5086#false} is VALID [2020-07-08 12:46:26,367 INFO L280 TraceCheckUtils]: 46: Hoare triple {5086#false} havoc #t~ret19.base, #t~ret19.offset; {5086#false} is VALID [2020-07-08 12:46:26,367 INFO L263 TraceCheckUtils]: 47: Hoare triple {5086#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5086#false} is VALID [2020-07-08 12:46:26,367 INFO L280 TraceCheckUtils]: 48: Hoare triple {5086#false} ~cond := #in~cond; {5086#false} is VALID [2020-07-08 12:46:26,367 INFO L280 TraceCheckUtils]: 49: Hoare triple {5086#false} assume 0 == ~cond; {5086#false} is VALID [2020-07-08 12:46:26,367 INFO L280 TraceCheckUtils]: 50: Hoare triple {5086#false} assume !false; {5086#false} is VALID [2020-07-08 12:46:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:26,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637040356] [2020-07-08 12:46:26,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199853162] [2020-07-08 12:46:26,370 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:26,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:46:26,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:26,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:46:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:26,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:26,522 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:26,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {5085#true} call ULTIMATE.init(); {5085#true} is VALID [2020-07-08 12:46:26,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-08 12:46:26,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-08 12:46:26,557 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L263 TraceCheckUtils]: 4: Hoare triple {5085#true} call #t~ret23 := main(); {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {5085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 6: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 7: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 9: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-08 12:46:26,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-08 12:46:26,559 INFO L280 TraceCheckUtils]: 12: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-08 12:46:26,559 INFO L280 TraceCheckUtils]: 13: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-08 12:46:26,559 INFO L280 TraceCheckUtils]: 14: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-08 12:46:26,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-08 12:46:26,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {5085#true} assume !(~i~1 < 8); {5085#true} is VALID [2020-07-08 12:46:26,560 INFO L280 TraceCheckUtils]: 17: Hoare triple {5085#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5085#true} is VALID [2020-07-08 12:46:26,560 INFO L263 TraceCheckUtils]: 18: Hoare triple {5085#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5085#true} is VALID [2020-07-08 12:46:26,560 INFO L280 TraceCheckUtils]: 19: Hoare triple {5085#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); {5085#true} is VALID [2020-07-08 12:46:26,560 INFO L280 TraceCheckUtils]: 20: Hoare triple {5085#true} assume !(~str.base == 0 && ~str.offset == 0); {5085#true} is VALID [2020-07-08 12:46:26,560 INFO L280 TraceCheckUtils]: 21: Hoare triple {5085#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5085#true} is VALID [2020-07-08 12:46:26,560 INFO L280 TraceCheckUtils]: 22: Hoare triple {5085#true} assume !#t~switch4; {5085#true} is VALID [2020-07-08 12:46:26,561 INFO L280 TraceCheckUtils]: 23: Hoare triple {5085#true} havoc #t~switch4;havoc #t~mem3; {5085#true} is VALID [2020-07-08 12:46:26,561 INFO L280 TraceCheckUtils]: 24: Hoare triple {5085#true} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5085#true} is VALID [2020-07-08 12:46:26,561 INFO L280 TraceCheckUtils]: 25: Hoare triple {5085#true} assume !!(0 != #t~mem1);havoc #t~mem1; {5085#true} is VALID [2020-07-08 12:46:26,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {5085#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5085#true} is VALID [2020-07-08 12:46:26,561 INFO L280 TraceCheckUtils]: 27: Hoare triple {5085#true} assume #t~switch4; {5085#true} is VALID [2020-07-08 12:46:26,562 INFO L280 TraceCheckUtils]: 28: Hoare triple {5085#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5085#true} is VALID [2020-07-08 12:46:26,562 INFO L280 TraceCheckUtils]: 29: Hoare triple {5085#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5085#true} is VALID [2020-07-08 12:46:26,562 INFO L280 TraceCheckUtils]: 30: Hoare triple {5085#true} assume !#t~short7;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {5085#true} is VALID [2020-07-08 12:46:26,562 INFO L280 TraceCheckUtils]: 31: Hoare triple {5085#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5085#true} is VALID [2020-07-08 12:46:26,562 INFO L280 TraceCheckUtils]: 32: Hoare triple {5085#true} assume !(34 == #t~mem9);havoc #t~mem9; {5085#true} is VALID [2020-07-08 12:46:26,562 INFO L280 TraceCheckUtils]: 33: Hoare triple {5085#true} ~j~0 := ~i~0 - 1; {5085#true} is VALID [2020-07-08 12:46:26,563 INFO L280 TraceCheckUtils]: 34: Hoare triple {5085#true} #t~short14 := 0 < ~j~0; {5085#true} is VALID [2020-07-08 12:46:26,563 INFO L280 TraceCheckUtils]: 35: Hoare triple {5085#true} assume !#t~short14; {5085#true} is VALID [2020-07-08 12:46:26,563 INFO L280 TraceCheckUtils]: 36: Hoare triple {5085#true} assume !#t~short14;havoc #t~mem12;havoc #t~short14;havoc #t~mem11;havoc #t~short13; {5085#true} is VALID [2020-07-08 12:46:26,563 INFO L280 TraceCheckUtils]: 37: Hoare triple {5085#true} #t~short17 := 0 < ~j~0; {5085#true} is VALID [2020-07-08 12:46:26,563 INFO L280 TraceCheckUtils]: 38: Hoare triple {5085#true} assume !#t~short17; {5085#true} is VALID [2020-07-08 12:46:26,564 INFO L280 TraceCheckUtils]: 39: Hoare triple {5085#true} assume !#t~short17;havoc #t~mem16;havoc #t~short17; {5085#true} is VALID [2020-07-08 12:46:26,564 INFO L280 TraceCheckUtils]: 40: Hoare triple {5085#true} assume ~start~0 <= ~j~0; {5085#true} is VALID [2020-07-08 12:46:26,565 INFO L280 TraceCheckUtils]: 41: Hoare triple {5085#true} assume !(1 + (~j~0 - ~start~0) >= 2); {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-08 12:46:26,565 INFO L263 TraceCheckUtils]: 42: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {5085#true} is VALID [2020-07-08 12:46:26,565 INFO L280 TraceCheckUtils]: 43: Hoare triple {5085#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~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-08 12:46:26,565 INFO L280 TraceCheckUtils]: 44: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-08 12:46:26,566 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5085#true} {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} #147#return; {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-08 12:46:26,567 INFO L280 TraceCheckUtils]: 46: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} havoc #t~ret19.base, #t~ret19.offset; {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-08 12:46:26,568 INFO L263 TraceCheckUtils]: 47: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:46:26,568 INFO L280 TraceCheckUtils]: 48: Hoare triple {5245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:46:26,569 INFO L280 TraceCheckUtils]: 49: Hoare triple {5249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5086#false} is VALID [2020-07-08 12:46:26,569 INFO L280 TraceCheckUtils]: 50: Hoare triple {5086#false} assume !false; {5086#false} is VALID [2020-07-08 12:46:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-08 12:46:26,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:26,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2020-07-08 12:46:26,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729281801] [2020-07-08 12:46:26,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-08 12:46:26,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:26,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:26,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:26,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:46:26,618 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 5 states. [2020-07-08 12:46:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:26,857 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-08 12:46:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:26,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-08 12:46:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-08 12:46:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-08 12:46:26,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2020-07-08 12:46:26,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:26,938 INFO L225 Difference]: With dead ends: 86 [2020-07-08 12:46:26,938 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:46:26,939 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:46:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:46:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:46:26,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:26,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:26,940 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:26,940 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:26,940 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:26,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:26,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:26,941 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:26,941 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:26,941 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:26,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:26,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:26,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:26,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:46:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:46:26,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-08 12:46:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:26,943 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:46:26,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:26,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:27,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:27,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:46:27,326 INFO L268 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2020-07-08 12:46:27,327 INFO L268 CegarLoopResult]: For program point L60-2(line 60) no Hoare annotation was computed. [2020-07-08 12:46:27,327 INFO L268 CegarLoopResult]: For program point L60-4(lines 54 72) no Hoare annotation was computed. [2020-07-08 12:46:27,327 INFO L268 CegarLoopResult]: For program point L56-1(line 56) no Hoare annotation was computed. [2020-07-08 12:46:27,327 INFO L268 CegarLoopResult]: For program point L56-3(line 56) no Hoare annotation was computed. [2020-07-08 12:46:27,328 INFO L271 CegarLoopResult]: At program point L56-5(line 56) the Hoare annotation is: true [2020-07-08 12:46:27,328 INFO L268 CegarLoopResult]: For program point L52-1(lines 52 73) no Hoare annotation was computed. [2020-07-08 12:46:27,328 INFO L268 CegarLoopResult]: For program point L56-6(line 56) no Hoare annotation was computed. [2020-07-08 12:46:27,329 INFO L268 CegarLoopResult]: For program point L52-2(lines 52 73) no Hoare annotation was computed. [2020-07-08 12:46:27,330 INFO L271 CegarLoopResult]: At program point L52-4(lines 52 73) the Hoare annotation is: true [2020-07-08 12:46:27,330 INFO L268 CegarLoopResult]: For program point L52-5(lines 52 73) no Hoare annotation was computed. [2020-07-08 12:46:27,330 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-07-08 12:46:27,332 INFO L268 CegarLoopResult]: For program point L65-1(line 65) no Hoare annotation was computed. [2020-07-08 12:46:27,332 INFO L268 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2020-07-08 12:46:27,332 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-08 12:46:27,332 INFO L268 CegarLoopResult]: For program point L57-2(line 57) no Hoare annotation was computed. [2020-07-08 12:46:27,332 INFO L264 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-07-08 12:46:27,332 INFO L268 CegarLoopResult]: For program point L66-1(line 66) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point parse_expression_listFINAL(lines 47 75) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point L62(lines 62 64) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L264 CegarLoopResult]: At program point parse_expression_listENTRY(lines 47 75) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point L54(lines 54 72) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point parse_expression_listEXIT(lines 47 75) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point L59-1(line 59) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point L59-2(line 59) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2020-07-08 12:46:27,333 INFO L268 CegarLoopResult]: For program point L59-4(line 59) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point L59-6(line 59) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L271 CegarLoopResult]: At program point L59-8(line 59) the Hoare annotation is: true [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point L59-9(line 59) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point r_strncpyFINAL(line 31) no Hoare annotation was computed. [2020-07-08 12:46:27,334 INFO L268 CegarLoopResult]: For program point r_strncpyEXIT(line 31) no Hoare annotation was computed. [2020-07-08 12:46:27,335 INFO L271 CegarLoopResult]: At program point r_strncpyENTRY(line 31) the Hoare annotation is: true [2020-07-08 12:46:27,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:27,336 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:46:27,336 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:46:27,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:27,336 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 76 85) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-08 12:46:27,336 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 76 85) no Hoare annotation was computed. [2020-07-08 12:46:27,336 INFO L271 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: true [2020-07-08 12:46:27,336 INFO L268 CegarLoopResult]: For program point L83-1(line 83) no Hoare annotation was computed. [2020-07-08 12:46:27,337 INFO L268 CegarLoopResult]: For program point L79-2(lines 79 81) no Hoare annotation was computed. [2020-07-08 12:46:27,337 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 76 85) no Hoare annotation was computed. [2020-07-08 12:46:27,337 INFO L271 CegarLoopResult]: At program point L79-3(lines 79 81) the Hoare annotation is: true [2020-07-08 12:46:27,338 INFO L268 CegarLoopResult]: For program point L79-4(lines 79 81) no Hoare annotation was computed. [2020-07-08 12:46:27,338 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-08 12:46:27,338 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:46:27,338 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:46:27,338 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:46:27,338 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-08 12:46:27,339 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:46:27,344 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-08 12:46:27,345 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:27,345 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-08 12:46:27,346 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:27,346 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-08 12:46:27,347 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-08 12:46:27,347 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:27,347 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-08 12:46:27,347 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:27,348 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-08 12:46:27,348 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-08 12:46:27,348 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-08 12:46:27,348 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:27,348 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:27,348 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2020-07-08 12:46:27,349 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:46:27,349 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-08 12:46:27,349 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:27,349 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2020-07-08 12:46:27,349 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:27,349 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-08 12:46:27,350 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-08 12:46:27,350 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:27,350 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:27,350 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:46:27,350 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2020-07-08 12:46:27,351 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:46:27,351 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:46:27,351 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-08 12:46:27,351 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-08 12:46:27,351 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-08 12:46:27,353 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:27,353 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-08 12:46:27,353 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-08 12:46:27,353 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-08 12:46:27,353 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 12:46:27,353 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-08 12:46:27,354 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-08 12:46:27,354 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:27,354 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-08 12:46:27,354 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-08 12:46:27,354 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-08 12:46:27,354 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-08 12:46:27,355 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-08 12:46:27,355 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:27,355 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-08 12:46:27,355 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-08 12:46:27,355 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-08 12:46:27,356 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-08 12:46:27,356 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-08 12:46:27,356 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-08 12:46:27,356 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-08 12:46:27,356 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-08 12:46:27,356 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-08 12:46:27,357 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-08 12:46:27,357 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-08 12:46:27,357 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-08 12:46:27,357 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-08 12:46:27,357 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-08 12:46:27,357 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-08 12:46:27,358 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-08 12:46:27,359 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-08 12:46:27,359 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 12:46:27,359 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 12:46:27,359 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-08 12:46:27,359 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:46:27,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:27 BoogieIcfgContainer [2020-07-08 12:46:27,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:27,376 INFO L168 Benchmark]: Toolchain (without parser) took 14134.29 ms. Allocated memory was 137.9 MB in the beginning and 356.5 MB in the end (delta: 218.6 MB). Free memory was 101.9 MB in the beginning and 124.2 MB in the end (delta: -22.3 MB). Peak memory consumption was 196.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:27,377 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:46:27,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.13 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 101.9 MB in the beginning and 176.5 MB in the end (delta: -74.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:27,382 INFO L168 Benchmark]: Boogie Preprocessor took 56.79 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 173.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:27,383 INFO L168 Benchmark]: RCFGBuilder took 662.84 ms. Allocated memory is still 200.8 MB. Free memory was 173.6 MB in the beginning and 130.3 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:27,391 INFO L168 Benchmark]: TraceAbstraction took 13023.30 ms. Allocated memory was 200.8 MB in the beginning and 356.5 MB in the end (delta: 155.7 MB). Free memory was 130.3 MB in the beginning and 124.2 MB in the end (delta: 6.1 MB). Peak memory consumption was 161.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:27,395 INFO L336 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.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.13 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 101.9 MB in the beginning and 176.5 MB in the end (delta: -74.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.79 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 173.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 662.84 ms. Allocated memory is still 200.8 MB. Free memory was 173.6 MB in the beginning and 130.3 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13023.30 ms. Allocated memory was 200.8 MB in the beginning and 356.5 MB in the end (delta: 155.7 MB). Free memory was 130.3 MB in the beginning and 124.2 MB in the end (delta: 6.1 MB). Peak memory consumption was 161.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.7s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 562 SDtfs, 239 SDslu, 1419 SDs, 0 SdLazy, 787 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 64 PreInvPairs, 94 NumberOfFragments, 35 HoareAnnotationTreeSize, 64 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 896 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 62932 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1443 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 72/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...