/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/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:48,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:48,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:48,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:48,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:48,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:48,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:48,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:48,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:48,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:48,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:48,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:48,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:48,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:48,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:48,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:48,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:48,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:48,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:48,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:48,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:48,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:48,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:48,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:48,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:48,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:48,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:48,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:48,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:48,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:48,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:48,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:48,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:48,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:48,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:48,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:48,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:48,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:48,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:48,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:48,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:48,209 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-17 22:50:48,246 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:48,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:48,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:48,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:48,248 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:48,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:48,250 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:48,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:48,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:48,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:48,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:48,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:48,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:48,252 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:48,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:48,252 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:48,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:48,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:48,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:48,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:48,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:48,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:48,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:48,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:48,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:48,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:48,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:48,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:48,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:48,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:48,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:48,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:48,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:48,525 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:48,526 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:48,526 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-17 22:50:48,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b6e8752/b153e60f8992444bb08fd0a52ab9d9b9/FLAG163f47767 [2020-07-17 22:50:49,092 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:49,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-17 22:50:49,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b6e8752/b153e60f8992444bb08fd0a52ab9d9b9/FLAG163f47767 [2020-07-17 22:50:49,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b6e8752/b153e60f8992444bb08fd0a52ab9d9b9 [2020-07-17 22:50:49,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:49,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:49,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:49,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:49,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:49,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfc5529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49, skipping insertion in model container [2020-07-17 22:50:49,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:49,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:49,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:49,788 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:49,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:49,937 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:49,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49 WrapperNode [2020-07-17 22:50:49,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:49,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:49,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:49,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:49,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (1/1) ... [2020-07-17 22:50:49,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:49,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:49,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:49,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:49,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (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-17 22:50:50,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-07-17 22:50:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-07-17 22:50:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-17 22:50:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-17 22:50:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-17 22:50:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-17 22:50:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-07-17 22:50:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-17 22:50:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-17 22:50:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-17 22:50:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-07-17 22:50:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-07-17 22:50:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-07-17 22:50:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-07-17 22:50:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-07-17 22:50:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-07-17 22:50:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-07-17 22:50:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-07-17 22:50:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-07-17 22:50:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-07-17 22:50:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-07-17 22:50:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-07-17 22:50:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:50,639 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:50,640 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:50:50,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:50 BoogieIcfgContainer [2020-07-17 22:50:50,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:50,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:50,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:50,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:50,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:49" (1/3) ... [2020-07-17 22:50:50,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f33738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:50, skipping insertion in model container [2020-07-17 22:50:50,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:49" (2/3) ... [2020-07-17 22:50:50,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f33738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:50, skipping insertion in model container [2020-07-17 22:50:50,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:50" (3/3) ... [2020-07-17 22:50:50,661 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-17 22:50:50,673 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:50,682 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:50,696 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:50,724 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:50,724 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:50,725 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:50,725 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:50,726 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:50,726 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:50,726 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:50,727 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-07-17 22:50:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:50:50,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:50,748 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] [2020-07-17 22:50:50,749 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2018987797, now seen corresponding path program 1 times [2020-07-17 22:50:50,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:50,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341225937] [2020-07-17 22:50:50,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(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; {54#true} is VALID [2020-07-17 22:50:50,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:50:50,991 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #133#return; {54#true} is VALID [2020-07-17 22:50:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {54#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; {54#true} is VALID [2020-07-17 22:50:51,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:50:51,027 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54#true} {55#false} #129#return; {55#false} is VALID [2020-07-17 22:50:51,029 INFO L263 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:51,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(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; {54#true} is VALID [2020-07-17 22:50:51,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:50:51,029 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #133#return; {54#true} is VALID [2020-07-17 22:50:51,030 INFO L263 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret21 := main(); {54#true} is VALID [2020-07-17 22:50:51,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {54#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {54#true} is VALID [2020-07-17 22:50:51,030 INFO L263 TraceCheckUtils]: 6: Hoare triple {54#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {54#true} is VALID [2020-07-17 22:50:51,031 INFO L280 TraceCheckUtils]: 7: Hoare triple {54#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); {54#true} is VALID [2020-07-17 22:50:51,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {54#true} assume !(~str.base == 0 && ~str.offset == 0); {54#true} is VALID [2020-07-17 22:50:51,032 INFO L280 TraceCheckUtils]: 9: Hoare triple {54#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; {54#true} is VALID [2020-07-17 22:50:51,032 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#true} assume #t~switch4; {54#true} is VALID [2020-07-17 22:50:51,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {54#true} assume !true; {55#false} is VALID [2020-07-17 22:50:51,033 INFO L280 TraceCheckUtils]: 12: Hoare triple {55#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {55#false} is VALID [2020-07-17 22:50:51,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {55#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {55#false} is VALID [2020-07-17 22:50:51,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {55#false} ~j~0 := ~i~0 - 1; {55#false} is VALID [2020-07-17 22:50:51,034 INFO L280 TraceCheckUtils]: 15: Hoare triple {55#false} assume !true; {55#false} is VALID [2020-07-17 22:50:51,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#false} #t~short17 := 0 < ~j~0; {55#false} is VALID [2020-07-17 22:50:51,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {55#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {55#false} is VALID [2020-07-17 22:50:51,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {55#false} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {55#false} is VALID [2020-07-17 22:50:51,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#false} assume ~start~0 <= ~j~0; {55#false} is VALID [2020-07-17 22:50:51,036 INFO L263 TraceCheckUtils]: 20: Hoare triple {55#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)); {54#true} is VALID [2020-07-17 22:50:51,037 INFO L280 TraceCheckUtils]: 21: Hoare triple {54#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; {54#true} is VALID [2020-07-17 22:50:51,037 INFO L280 TraceCheckUtils]: 22: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:50:51,037 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {54#true} {55#false} #129#return; {55#false} is VALID [2020-07-17 22:50:51,038 INFO L280 TraceCheckUtils]: 24: Hoare triple {55#false} havoc #t~ret19.base, #t~ret19.offset; {55#false} is VALID [2020-07-17 22:50:51,038 INFO L263 TraceCheckUtils]: 25: Hoare triple {55#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {55#false} is VALID [2020-07-17 22:50:51,038 INFO L280 TraceCheckUtils]: 26: Hoare triple {55#false} ~cond := #in~cond; {55#false} is VALID [2020-07-17 22:50:51,039 INFO L280 TraceCheckUtils]: 27: Hoare triple {55#false} assume 0 == ~cond; {55#false} is VALID [2020-07-17 22:50:51,039 INFO L280 TraceCheckUtils]: 28: Hoare triple {55#false} assume !false; {55#false} is VALID [2020-07-17 22:50:51,043 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-17 22:50:51,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341225937] [2020-07-17 22:50:51,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:51,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:51,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711569742] [2020-07-17 22:50:51,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:50:51,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:51,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:51,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:51,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:51,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:51,127 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-07-17 22:50:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:51,410 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2020-07-17 22:50:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:51,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:50:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2020-07-17 22:50:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2020-07-17 22:50:51,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2020-07-17 22:50:51,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:51,604 INFO L225 Difference]: With dead ends: 93 [2020-07-17 22:50:51,605 INFO L226 Difference]: Without dead ends: 43 [2020-07-17 22:50:51,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-17 22:50:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-17 22:50:51,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:51,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-17 22:50:51,657 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-17 22:50:51,657 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-17 22:50:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:51,663 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-17 22:50:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-17 22:50:51,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:51,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:51,664 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-17 22:50:51,664 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-17 22:50:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:51,669 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-17 22:50:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-17 22:50:51,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:51,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:51,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:51,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:50:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-07-17 22:50:51,676 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2020-07-17 22:50:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:51,677 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-17 22:50:51,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-17 22:50:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:50:51,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:51,679 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] [2020-07-17 22:50:51,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:51,679 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash -171780126, now seen corresponding path program 1 times [2020-07-17 22:50:51,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:51,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941842343] [2020-07-17 22:50:51,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#(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; {320#true} is VALID [2020-07-17 22:50:51,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-17 22:50:51,769 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #133#return; {320#true} is VALID [2020-07-17 22:50:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {320#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; {320#true} is VALID [2020-07-17 22:50:51,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-17 22:50:51,776 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {321#false} #129#return; {321#false} is VALID [2020-07-17 22:50:51,777 INFO L263 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:51,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#(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; {320#true} is VALID [2020-07-17 22:50:51,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-17 22:50:51,778 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #133#return; {320#true} is VALID [2020-07-17 22:50:51,779 INFO L263 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret21 := main(); {320#true} is VALID [2020-07-17 22:50:51,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {320#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {320#true} is VALID [2020-07-17 22:50:51,779 INFO L263 TraceCheckUtils]: 6: Hoare triple {320#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {320#true} is VALID [2020-07-17 22:50:51,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {320#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); {320#true} is VALID [2020-07-17 22:50:51,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#true} assume !(~str.base == 0 && ~str.offset == 0); {320#true} is VALID [2020-07-17 22:50:51,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#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; {320#true} is VALID [2020-07-17 22:50:51,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {320#true} assume #t~switch4; {320#true} is VALID [2020-07-17 22:50:51,781 INFO L280 TraceCheckUtils]: 11: Hoare triple {320#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {320#true} is VALID [2020-07-17 22:50:51,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {320#true} assume #t~short7; {325#|parse_expression_list_#t~short7|} is VALID [2020-07-17 22:50:51,782 INFO L280 TraceCheckUtils]: 13: Hoare triple {325#|parse_expression_list_#t~short7|} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {321#false} is VALID [2020-07-17 22:50:51,782 INFO L280 TraceCheckUtils]: 14: Hoare triple {321#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {321#false} is VALID [2020-07-17 22:50:51,783 INFO L280 TraceCheckUtils]: 15: Hoare triple {321#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {321#false} is VALID [2020-07-17 22:50:51,783 INFO L280 TraceCheckUtils]: 16: Hoare triple {321#false} ~j~0 := ~i~0 - 1; {321#false} is VALID [2020-07-17 22:50:51,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {321#false} #t~short14 := 0 < ~j~0; {321#false} is VALID [2020-07-17 22:50:51,784 INFO L280 TraceCheckUtils]: 18: Hoare triple {321#false} assume !#t~short14; {321#false} is VALID [2020-07-17 22:50:51,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {321#false} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {321#false} is VALID [2020-07-17 22:50:51,784 INFO L280 TraceCheckUtils]: 20: Hoare triple {321#false} #t~short17 := 0 < ~j~0; {321#false} is VALID [2020-07-17 22:50:51,785 INFO L280 TraceCheckUtils]: 21: Hoare triple {321#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {321#false} is VALID [2020-07-17 22:50:51,785 INFO L280 TraceCheckUtils]: 22: Hoare triple {321#false} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {321#false} is VALID [2020-07-17 22:50:51,785 INFO L280 TraceCheckUtils]: 23: Hoare triple {321#false} assume ~start~0 <= ~j~0; {321#false} is VALID [2020-07-17 22:50:51,785 INFO L263 TraceCheckUtils]: 24: Hoare triple {321#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)); {320#true} is VALID [2020-07-17 22:50:51,786 INFO L280 TraceCheckUtils]: 25: Hoare triple {320#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; {320#true} is VALID [2020-07-17 22:50:51,786 INFO L280 TraceCheckUtils]: 26: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-17 22:50:51,786 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {320#true} {321#false} #129#return; {321#false} is VALID [2020-07-17 22:50:51,787 INFO L280 TraceCheckUtils]: 28: Hoare triple {321#false} havoc #t~ret19.base, #t~ret19.offset; {321#false} is VALID [2020-07-17 22:50:51,787 INFO L263 TraceCheckUtils]: 29: Hoare triple {321#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {321#false} is VALID [2020-07-17 22:50:51,787 INFO L280 TraceCheckUtils]: 30: Hoare triple {321#false} ~cond := #in~cond; {321#false} is VALID [2020-07-17 22:50:51,788 INFO L280 TraceCheckUtils]: 31: Hoare triple {321#false} assume 0 == ~cond; {321#false} is VALID [2020-07-17 22:50:51,788 INFO L280 TraceCheckUtils]: 32: Hoare triple {321#false} assume !false; {321#false} is VALID [2020-07-17 22:50:51,789 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-17 22:50:51,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941842343] [2020-07-17 22:50:51,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:51,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:51,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437250909] [2020-07-17 22:50:51,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-17 22:50:51,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:51,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:51,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:51,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:51,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:51,834 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2020-07-17 22:50:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:52,082 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-17 22:50:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:52,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-17 22:50:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2020-07-17 22:50:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2020-07-17 22:50:52,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2020-07-17 22:50:52,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:52,230 INFO L225 Difference]: With dead ends: 78 [2020-07-17 22:50:52,230 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:50:52,231 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-17 22:50:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:50:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-17 22:50:52,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:52,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-17 22:50:52,248 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:50:52,248 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:50:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:52,252 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:50:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:50:52,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:52,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:52,253 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:50:52,253 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:50:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:52,256 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:50:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:50:52,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:52,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:52,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:52,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:50:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-17 22:50:52,261 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2020-07-17 22:50:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:52,261 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-17 22:50:52,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:50:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:50:52,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:52,263 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] [2020-07-17 22:50:52,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:52,264 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 250921700, now seen corresponding path program 1 times [2020-07-17 22:50:52,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:52,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554689282] [2020-07-17 22:50:52,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {588#(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; {575#true} is VALID [2020-07-17 22:50:52,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-17 22:50:52,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {575#true} {575#true} #133#return; {575#true} is VALID [2020-07-17 22:50:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {575#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; {575#true} is VALID [2020-07-17 22:50:52,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-17 22:50:52,417 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {575#true} {576#false} #129#return; {576#false} is VALID [2020-07-17 22:50:52,418 INFO L263 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:52,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {588#(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; {575#true} is VALID [2020-07-17 22:50:52,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-17 22:50:52,419 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #133#return; {575#true} is VALID [2020-07-17 22:50:52,419 INFO L263 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret21 := main(); {575#true} is VALID [2020-07-17 22:50:52,420 INFO L280 TraceCheckUtils]: 5: Hoare triple {575#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {575#true} is VALID [2020-07-17 22:50:52,420 INFO L263 TraceCheckUtils]: 6: Hoare triple {575#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {575#true} is VALID [2020-07-17 22:50:52,421 INFO L280 TraceCheckUtils]: 7: Hoare triple {575#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); {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {580#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {580#(= 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; {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {580#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,424 INFO L280 TraceCheckUtils]: 11: Hoare triple {580#(= 0 parse_expression_list_~start~0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {580#(= 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; {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,425 INFO L280 TraceCheckUtils]: 13: Hoare triple {580#(= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,426 INFO L280 TraceCheckUtils]: 14: Hoare triple {580#(= 0 parse_expression_list_~start~0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,426 INFO L280 TraceCheckUtils]: 15: Hoare triple {580#(= 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; {581#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,427 INFO L280 TraceCheckUtils]: 16: Hoare triple {581#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {581#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,428 INFO L280 TraceCheckUtils]: 17: Hoare triple {581#(<= 1 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {582#(or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|)} is VALID [2020-07-17 22:50:52,429 INFO L280 TraceCheckUtils]: 18: Hoare triple {582#(or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|)} assume !#t~short14; {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,430 INFO L280 TraceCheckUtils]: 20: Hoare triple {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} #t~short17 := 0 < ~j~0; {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,431 INFO L280 TraceCheckUtils]: 21: Hoare triple {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {584#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:52,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {584#(<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {576#false} is VALID [2020-07-17 22:50:52,433 INFO L263 TraceCheckUtils]: 24: Hoare triple {576#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)); {575#true} is VALID [2020-07-17 22:50:52,433 INFO L280 TraceCheckUtils]: 25: Hoare triple {575#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; {575#true} is VALID [2020-07-17 22:50:52,434 INFO L280 TraceCheckUtils]: 26: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-17 22:50:52,434 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {575#true} {576#false} #129#return; {576#false} is VALID [2020-07-17 22:50:52,434 INFO L280 TraceCheckUtils]: 28: Hoare triple {576#false} havoc #t~ret19.base, #t~ret19.offset; {576#false} is VALID [2020-07-17 22:50:52,434 INFO L263 TraceCheckUtils]: 29: Hoare triple {576#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {576#false} is VALID [2020-07-17 22:50:52,435 INFO L280 TraceCheckUtils]: 30: Hoare triple {576#false} ~cond := #in~cond; {576#false} is VALID [2020-07-17 22:50:52,435 INFO L280 TraceCheckUtils]: 31: Hoare triple {576#false} assume 0 == ~cond; {576#false} is VALID [2020-07-17 22:50:52,435 INFO L280 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID [2020-07-17 22:50:52,438 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-17 22:50:52,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554689282] [2020-07-17 22:50:52,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:52,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:50:52,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910341481] [2020-07-17 22:50:52,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-17 22:50:52,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:52,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:52,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:52,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:52,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:52,479 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 8 states. [2020-07-17 22:50:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:53,415 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2020-07-17 22:50:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:50:53,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-17 22:50:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2020-07-17 22:50:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2020-07-17 22:50:53,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 183 transitions. [2020-07-17 22:50:53,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:53,640 INFO L225 Difference]: With dead ends: 140 [2020-07-17 22:50:53,640 INFO L226 Difference]: Without dead ends: 91 [2020-07-17 22:50:53,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:50:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-17 22:50:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2020-07-17 22:50:53,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:53,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 66 states. [2020-07-17 22:50:53,689 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 66 states. [2020-07-17 22:50:53,689 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 66 states. [2020-07-17 22:50:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:53,696 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2020-07-17 22:50:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2020-07-17 22:50:53,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:53,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:53,697 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 91 states. [2020-07-17 22:50:53,698 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 91 states. [2020-07-17 22:50:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:53,703 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2020-07-17 22:50:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2020-07-17 22:50:53,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:53,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:53,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:53,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 22:50:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2020-07-17 22:50:53,708 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 33 [2020-07-17 22:50:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:53,709 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2020-07-17 22:50:53,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2020-07-17 22:50:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:50:53,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:53,710 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] [2020-07-17 22:50:53,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:50:53,711 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1743223006, now seen corresponding path program 1 times [2020-07-17 22:50:53,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:53,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153196763] [2020-07-17 22:50:53,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {1048#(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; {1036#true} is VALID [2020-07-17 22:50:53,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-17 22:50:53,864 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1036#true} {1036#true} #133#return; {1036#true} is VALID [2020-07-17 22:50:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {1036#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; {1036#true} is VALID [2020-07-17 22:50:53,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-17 22:50:53,881 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1036#true} {1037#false} #129#return; {1037#false} is VALID [2020-07-17 22:50:53,882 INFO L263 TraceCheckUtils]: 0: Hoare triple {1036#true} call ULTIMATE.init(); {1048#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:53,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {1048#(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; {1036#true} is VALID [2020-07-17 22:50:53,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-17 22:50:53,883 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #133#return; {1036#true} is VALID [2020-07-17 22:50:53,883 INFO L263 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret21 := main(); {1036#true} is VALID [2020-07-17 22:50:53,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {1036#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1036#true} is VALID [2020-07-17 22:50:53,883 INFO L263 TraceCheckUtils]: 6: Hoare triple {1036#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1036#true} is VALID [2020-07-17 22:50:53,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {1036#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); {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,899 INFO L280 TraceCheckUtils]: 8: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {1041#(= 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; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {1041#(= 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; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} assume !(34 == #t~mem9);havoc #t~mem9; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,909 INFO L280 TraceCheckUtils]: 16: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:53,910 INFO L280 TraceCheckUtils]: 17: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {1042#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (= 0 parse_expression_list_~start~0))} is VALID [2020-07-17 22:50:53,911 INFO L280 TraceCheckUtils]: 18: Hoare triple {1042#(and (or (<= parse_expression_list_~j~0 0) |parse_expression_list_#t~short14|) (= 0 parse_expression_list_~start~0))} assume !#t~short14; {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:53,911 INFO L280 TraceCheckUtils]: 19: Hoare triple {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:53,912 INFO L280 TraceCheckUtils]: 20: Hoare triple {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:53,918 INFO L280 TraceCheckUtils]: 21: Hoare triple {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:53,919 INFO L280 TraceCheckUtils]: 22: Hoare triple {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {1044#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,920 INFO L280 TraceCheckUtils]: 23: Hoare triple {1044#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1037#false} is VALID [2020-07-17 22:50:53,920 INFO L263 TraceCheckUtils]: 24: Hoare triple {1037#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)); {1036#true} is VALID [2020-07-17 22:50:53,921 INFO L280 TraceCheckUtils]: 25: Hoare triple {1036#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; {1036#true} is VALID [2020-07-17 22:50:53,921 INFO L280 TraceCheckUtils]: 26: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-17 22:50:53,921 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1036#true} {1037#false} #129#return; {1037#false} is VALID [2020-07-17 22:50:53,921 INFO L280 TraceCheckUtils]: 28: Hoare triple {1037#false} havoc #t~ret19.base, #t~ret19.offset; {1037#false} is VALID [2020-07-17 22:50:53,922 INFO L263 TraceCheckUtils]: 29: Hoare triple {1037#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1037#false} is VALID [2020-07-17 22:50:53,922 INFO L280 TraceCheckUtils]: 30: Hoare triple {1037#false} ~cond := #in~cond; {1037#false} is VALID [2020-07-17 22:50:53,922 INFO L280 TraceCheckUtils]: 31: Hoare triple {1037#false} assume 0 == ~cond; {1037#false} is VALID [2020-07-17 22:50:53,922 INFO L280 TraceCheckUtils]: 32: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2020-07-17 22:50:53,925 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-17 22:50:53,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153196763] [2020-07-17 22:50:53,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:53,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:50:53,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330653785] [2020-07-17 22:50:53,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 22:50:53,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:53,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:53,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:53,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:53,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:53,974 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 7 states. [2020-07-17 22:50:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:54,487 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2020-07-17 22:50:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:54,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 22:50:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2020-07-17 22:50:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2020-07-17 22:50:54,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 160 transitions. [2020-07-17 22:50:54,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:54,690 INFO L225 Difference]: With dead ends: 136 [2020-07-17 22:50:54,690 INFO L226 Difference]: Without dead ends: 92 [2020-07-17 22:50:54,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-17 22:50:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2020-07-17 22:50:54,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:54,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 76 states. [2020-07-17 22:50:54,724 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 76 states. [2020-07-17 22:50:54,726 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 76 states. [2020-07-17 22:50:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:54,731 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-17 22:50:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-17 22:50:54,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:54,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:54,733 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 92 states. [2020-07-17 22:50:54,733 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 92 states. [2020-07-17 22:50:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:54,738 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-17 22:50:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-17 22:50:54,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:54,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:54,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:54,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 22:50:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2020-07-17 22:50:54,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 33 [2020-07-17 22:50:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:54,744 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-07-17 22:50:54,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2020-07-17 22:50:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:50:54,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:54,747 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] [2020-07-17 22:50:54,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:50:54,747 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1042158428, now seen corresponding path program 1 times [2020-07-17 22:50:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:54,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273333631] [2020-07-17 22:50:54,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:54,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#(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; {1495#true} is VALID [2020-07-17 22:50:54,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-17 22:50:54,880 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1495#true} #133#return; {1495#true} is VALID [2020-07-17 22:50:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:54,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {1495#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; {1495#true} is VALID [2020-07-17 22:50:54,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-17 22:50:54,889 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1496#false} #129#return; {1496#false} is VALID [2020-07-17 22:50:54,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1506#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:54,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#(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; {1495#true} is VALID [2020-07-17 22:50:54,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-17 22:50:54,891 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #133#return; {1495#true} is VALID [2020-07-17 22:50:54,891 INFO L263 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret21 := main(); {1495#true} is VALID [2020-07-17 22:50:54,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {1495#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1495#true} is VALID [2020-07-17 22:50:54,892 INFO L263 TraceCheckUtils]: 6: Hoare triple {1495#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1495#true} is VALID [2020-07-17 22:50:54,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {1495#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); {1500#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:50:54,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {1500#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1500#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:50:54,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {1500#(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; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,904 INFO L280 TraceCheckUtils]: 10: Hoare triple {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,905 INFO L280 TraceCheckUtils]: 11: Hoare triple {1501#(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; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,906 INFO L280 TraceCheckUtils]: 12: Hoare triple {1501#(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; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,920 INFO L280 TraceCheckUtils]: 13: Hoare triple {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,920 INFO L280 TraceCheckUtils]: 14: Hoare triple {1501#(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); {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,921 INFO L280 TraceCheckUtils]: 15: Hoare triple {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem9);havoc #t~mem9; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:54,922 INFO L280 TraceCheckUtils]: 16: Hoare triple {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,925 INFO L280 TraceCheckUtils]: 19: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,927 INFO L280 TraceCheckUtils]: 21: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,927 INFO L280 TraceCheckUtils]: 22: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:54,928 INFO L280 TraceCheckUtils]: 23: Hoare triple {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1496#false} is VALID [2020-07-17 22:50:54,928 INFO L263 TraceCheckUtils]: 24: Hoare triple {1496#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)); {1495#true} is VALID [2020-07-17 22:50:54,928 INFO L280 TraceCheckUtils]: 25: Hoare triple {1495#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; {1495#true} is VALID [2020-07-17 22:50:54,928 INFO L280 TraceCheckUtils]: 26: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-17 22:50:54,928 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1495#true} {1496#false} #129#return; {1496#false} is VALID [2020-07-17 22:50:54,929 INFO L280 TraceCheckUtils]: 28: Hoare triple {1496#false} havoc #t~ret19.base, #t~ret19.offset; {1496#false} is VALID [2020-07-17 22:50:54,929 INFO L263 TraceCheckUtils]: 29: Hoare triple {1496#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1496#false} is VALID [2020-07-17 22:50:54,929 INFO L280 TraceCheckUtils]: 30: Hoare triple {1496#false} ~cond := #in~cond; {1496#false} is VALID [2020-07-17 22:50:54,929 INFO L280 TraceCheckUtils]: 31: Hoare triple {1496#false} assume 0 == ~cond; {1496#false} is VALID [2020-07-17 22:50:54,929 INFO L280 TraceCheckUtils]: 32: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2020-07-17 22:50:54,931 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-17 22:50:54,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273333631] [2020-07-17 22:50:54,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:54,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:50:54,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102871885] [2020-07-17 22:50:54,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-17 22:50:54,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:54,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:54,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:54,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:54,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:54,973 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 6 states. [2020-07-17 22:50:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:55,489 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2020-07-17 22:50:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:55,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-17 22:50:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2020-07-17 22:50:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2020-07-17 22:50:55,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2020-07-17 22:50:55,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:55,652 INFO L225 Difference]: With dead ends: 138 [2020-07-17 22:50:55,652 INFO L226 Difference]: Without dead ends: 89 [2020-07-17 22:50:55,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-17 22:50:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-07-17 22:50:55,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:55,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 83 states. [2020-07-17 22:50:55,687 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 83 states. [2020-07-17 22:50:55,688 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 83 states. [2020-07-17 22:50:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:55,691 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-17 22:50:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-17 22:50:55,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:55,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:55,692 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 89 states. [2020-07-17 22:50:55,692 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 89 states. [2020-07-17 22:50:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:55,696 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-17 22:50:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-17 22:50:55,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:55,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:55,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:55,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-17 22:50:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2020-07-17 22:50:55,700 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 33 [2020-07-17 22:50:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:55,700 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2020-07-17 22:50:55,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2020-07-17 22:50:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 22:50:55,701 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:55,701 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] [2020-07-17 22:50:55,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:50:55,702 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:55,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash -151257089, now seen corresponding path program 1 times [2020-07-17 22:50:55,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:55,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010331990] [2020-07-17 22:50:55,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {1971#(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; {1961#true} is VALID [2020-07-17 22:50:55,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-17 22:50:55,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1961#true} #133#return; {1961#true} is VALID [2020-07-17 22:50:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {1961#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; {1961#true} is VALID [2020-07-17 22:50:55,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-17 22:50:55,767 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1962#false} #129#return; {1962#false} is VALID [2020-07-17 22:50:55,768 INFO L263 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1971#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:55,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {1971#(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; {1961#true} is VALID [2020-07-17 22:50:55,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-17 22:50:55,768 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #133#return; {1961#true} is VALID [2020-07-17 22:50:55,769 INFO L263 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret21 := main(); {1961#true} is VALID [2020-07-17 22:50:55,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1961#true} is VALID [2020-07-17 22:50:55,769 INFO L263 TraceCheckUtils]: 6: Hoare triple {1961#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1961#true} is VALID [2020-07-17 22:50:55,769 INFO L280 TraceCheckUtils]: 7: Hoare triple {1961#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); {1961#true} is VALID [2020-07-17 22:50:55,770 INFO L280 TraceCheckUtils]: 8: Hoare triple {1961#true} assume !(~str.base == 0 && ~str.offset == 0); {1961#true} is VALID [2020-07-17 22:50:55,770 INFO L280 TraceCheckUtils]: 9: Hoare triple {1961#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; {1961#true} is VALID [2020-07-17 22:50:55,770 INFO L280 TraceCheckUtils]: 10: Hoare triple {1961#true} assume #t~switch4; {1961#true} is VALID [2020-07-17 22:50:55,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {1961#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1961#true} is VALID [2020-07-17 22:50:55,771 INFO L280 TraceCheckUtils]: 12: Hoare triple {1961#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1961#true} is VALID [2020-07-17 22:50:55,771 INFO L280 TraceCheckUtils]: 13: Hoare triple {1961#true} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {1961#true} is VALID [2020-07-17 22:50:55,771 INFO L280 TraceCheckUtils]: 14: Hoare triple {1961#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1961#true} is VALID [2020-07-17 22:50:55,771 INFO L280 TraceCheckUtils]: 15: Hoare triple {1961#true} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1961#true} is VALID [2020-07-17 22:50:55,771 INFO L280 TraceCheckUtils]: 16: Hoare triple {1961#true} ~j~0 := ~i~0 - 1; {1961#true} is VALID [2020-07-17 22:50:55,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {1961#true} #t~short14 := 0 < ~j~0; {1961#true} is VALID [2020-07-17 22:50:55,772 INFO L280 TraceCheckUtils]: 18: Hoare triple {1961#true} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {1961#true} is VALID [2020-07-17 22:50:55,773 INFO L280 TraceCheckUtils]: 19: Hoare triple {1961#true} assume #t~short13; {1966#|parse_expression_list_#t~short13|} is VALID [2020-07-17 22:50:55,773 INFO L280 TraceCheckUtils]: 20: Hoare triple {1966#|parse_expression_list_#t~short13|} #t~short14 := #t~short13; {1967#|parse_expression_list_#t~short14|} is VALID [2020-07-17 22:50:55,774 INFO L280 TraceCheckUtils]: 21: Hoare triple {1967#|parse_expression_list_#t~short14|} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {1962#false} is VALID [2020-07-17 22:50:55,774 INFO L280 TraceCheckUtils]: 22: Hoare triple {1962#false} #t~short17 := 0 < ~j~0; {1962#false} is VALID [2020-07-17 22:50:55,774 INFO L280 TraceCheckUtils]: 23: Hoare triple {1962#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {1962#false} is VALID [2020-07-17 22:50:55,774 INFO L280 TraceCheckUtils]: 24: Hoare triple {1962#false} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {1962#false} is VALID [2020-07-17 22:50:55,775 INFO L280 TraceCheckUtils]: 25: Hoare triple {1962#false} assume ~start~0 <= ~j~0; {1962#false} is VALID [2020-07-17 22:50:55,775 INFO L263 TraceCheckUtils]: 26: Hoare triple {1962#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)); {1961#true} is VALID [2020-07-17 22:50:55,775 INFO L280 TraceCheckUtils]: 27: Hoare triple {1961#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; {1961#true} is VALID [2020-07-17 22:50:55,775 INFO L280 TraceCheckUtils]: 28: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-17 22:50:55,776 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1961#true} {1962#false} #129#return; {1962#false} is VALID [2020-07-17 22:50:55,776 INFO L280 TraceCheckUtils]: 30: Hoare triple {1962#false} havoc #t~ret19.base, #t~ret19.offset; {1962#false} is VALID [2020-07-17 22:50:55,776 INFO L263 TraceCheckUtils]: 31: Hoare triple {1962#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1962#false} is VALID [2020-07-17 22:50:55,776 INFO L280 TraceCheckUtils]: 32: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2020-07-17 22:50:55,777 INFO L280 TraceCheckUtils]: 33: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2020-07-17 22:50:55,777 INFO L280 TraceCheckUtils]: 34: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2020-07-17 22:50:55,778 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-17 22:50:55,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010331990] [2020-07-17 22:50:55,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:55,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:55,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382354190] [2020-07-17 22:50:55,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-17 22:50:55,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:55,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:55,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:55,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:55,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:55,814 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand 5 states. [2020-07-17 22:50:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:56,084 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2020-07-17 22:50:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:56,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-17 22:50:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2020-07-17 22:50:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2020-07-17 22:50:56,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2020-07-17 22:50:56,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:56,200 INFO L225 Difference]: With dead ends: 124 [2020-07-17 22:50:56,200 INFO L226 Difference]: Without dead ends: 89 [2020-07-17 22:50:56,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-17 22:50:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-07-17 22:50:56,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:56,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2020-07-17 22:50:56,237 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2020-07-17 22:50:56,238 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2020-07-17 22:50:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:56,242 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-17 22:50:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-17 22:50:56,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:56,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:56,243 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2020-07-17 22:50:56,243 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2020-07-17 22:50:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:56,246 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-17 22:50:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-17 22:50:56,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:56,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:56,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:56,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-17 22:50:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2020-07-17 22:50:56,250 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 35 [2020-07-17 22:50:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:56,251 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2020-07-17 22:50:56,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-17 22:50:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 22:50:56,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:56,252 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] [2020-07-17 22:50:56,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:50:56,252 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1172325443, now seen corresponding path program 1 times [2020-07-17 22:50:56,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:56,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740297360] [2020-07-17 22:50:56,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {2426#(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; {2414#true} is VALID [2020-07-17 22:50:56,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:50:56,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #133#return; {2414#true} is VALID [2020-07-17 22:50:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#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; {2414#true} is VALID [2020-07-17 22:50:56,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:50:56,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2415#false} #129#return; {2415#false} is VALID [2020-07-17 22:50:56,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:56,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {2426#(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; {2414#true} is VALID [2020-07-17 22:50:56,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:50:56,348 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #133#return; {2414#true} is VALID [2020-07-17 22:50:56,348 INFO L263 TraceCheckUtils]: 4: Hoare triple {2414#true} call #t~ret21 := main(); {2414#true} is VALID [2020-07-17 22:50:56,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {2414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2414#true} is VALID [2020-07-17 22:50:56,348 INFO L263 TraceCheckUtils]: 6: Hoare triple {2414#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2414#true} is VALID [2020-07-17 22:50:56,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {2414#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); {2419#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-17 22:50:56,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {2419#(<= (+ parse_expression_list_~i~0 1) 0)} assume !(~str.base == 0 && ~str.offset == 0); {2419#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-17 22:50:56,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {2419#(<= (+ 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; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {2420#(<= parse_expression_list_~i~0 0)} assume #t~switch4; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {2420#(<= parse_expression_list_~i~0 0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {2420#(<= 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; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,354 INFO L280 TraceCheckUtils]: 13: Hoare triple {2420#(<= parse_expression_list_~i~0 0)} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {2420#(<= parse_expression_list_~i~0 0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {2420#(<= 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; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:56,363 INFO L280 TraceCheckUtils]: 16: Hoare triple {2420#(<= parse_expression_list_~i~0 0)} ~j~0 := ~i~0 - 1; {2421#(<= (+ parse_expression_list_~j~0 1) 0)} is VALID [2020-07-17 22:50:56,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {2421#(<= (+ parse_expression_list_~j~0 1) 0)} #t~short14 := 0 < ~j~0; {2422#(not |parse_expression_list_#t~short14|)} is VALID [2020-07-17 22:50:56,370 INFO L280 TraceCheckUtils]: 18: Hoare triple {2422#(not |parse_expression_list_#t~short14|)} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {2415#false} is VALID [2020-07-17 22:50:56,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {2415#false} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {2415#false} is VALID [2020-07-17 22:50:56,371 INFO L280 TraceCheckUtils]: 20: Hoare triple {2415#false} #t~short14 := #t~short13; {2415#false} is VALID [2020-07-17 22:50:56,371 INFO L280 TraceCheckUtils]: 21: Hoare triple {2415#false} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {2415#false} is VALID [2020-07-17 22:50:56,371 INFO L280 TraceCheckUtils]: 22: Hoare triple {2415#false} #t~short17 := 0 < ~j~0; {2415#false} is VALID [2020-07-17 22:50:56,371 INFO L280 TraceCheckUtils]: 23: Hoare triple {2415#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {2415#false} is VALID [2020-07-17 22:50:56,372 INFO L280 TraceCheckUtils]: 24: Hoare triple {2415#false} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {2415#false} is VALID [2020-07-17 22:50:56,372 INFO L280 TraceCheckUtils]: 25: Hoare triple {2415#false} assume ~start~0 <= ~j~0; {2415#false} is VALID [2020-07-17 22:50:56,372 INFO L263 TraceCheckUtils]: 26: Hoare triple {2415#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)); {2414#true} is VALID [2020-07-17 22:50:56,373 INFO L280 TraceCheckUtils]: 27: Hoare triple {2414#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; {2414#true} is VALID [2020-07-17 22:50:56,373 INFO L280 TraceCheckUtils]: 28: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-17 22:50:56,373 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2414#true} {2415#false} #129#return; {2415#false} is VALID [2020-07-17 22:50:56,373 INFO L280 TraceCheckUtils]: 30: Hoare triple {2415#false} havoc #t~ret19.base, #t~ret19.offset; {2415#false} is VALID [2020-07-17 22:50:56,373 INFO L263 TraceCheckUtils]: 31: Hoare triple {2415#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2415#false} is VALID [2020-07-17 22:50:56,374 INFO L280 TraceCheckUtils]: 32: Hoare triple {2415#false} ~cond := #in~cond; {2415#false} is VALID [2020-07-17 22:50:56,374 INFO L280 TraceCheckUtils]: 33: Hoare triple {2415#false} assume 0 == ~cond; {2415#false} is VALID [2020-07-17 22:50:56,374 INFO L280 TraceCheckUtils]: 34: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2020-07-17 22:50:56,377 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-17 22:50:56,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740297360] [2020-07-17 22:50:56,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:56,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:50:56,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72404574] [2020-07-17 22:50:56,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-17 22:50:56,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:56,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:56,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:56,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:56,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:56,415 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 7 states. [2020-07-17 22:50:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:56,864 INFO L93 Difference]: Finished difference Result 147 states and 187 transitions. [2020-07-17 22:50:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:56,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-17 22:50:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2020-07-17 22:50:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2020-07-17 22:50:56,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 130 transitions. [2020-07-17 22:50:57,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:57,014 INFO L225 Difference]: With dead ends: 147 [2020-07-17 22:50:57,014 INFO L226 Difference]: Without dead ends: 89 [2020-07-17 22:50:57,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-17 22:50:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2020-07-17 22:50:57,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:57,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2020-07-17 22:50:57,044 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2020-07-17 22:50:57,045 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2020-07-17 22:50:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:57,048 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2020-07-17 22:50:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2020-07-17 22:50:57,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:57,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:57,049 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2020-07-17 22:50:57,049 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2020-07-17 22:50:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:57,052 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2020-07-17 22:50:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2020-07-17 22:50:57,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:57,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:57,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:57,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 22:50:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2020-07-17 22:50:57,056 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 35 [2020-07-17 22:50:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:57,057 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2020-07-17 22:50:57,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2020-07-17 22:50:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:50:57,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:57,058 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:57,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:50:57,058 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1310821647, now seen corresponding path program 1 times [2020-07-17 22:50:57,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:57,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484577122] [2020-07-17 22:50:57,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {2908#(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; {2895#true} is VALID [2020-07-17 22:50:57,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-17 22:50:57,203 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2895#true} {2895#true} #133#return; {2895#true} is VALID [2020-07-17 22:50:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {2895#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; {2895#true} is VALID [2020-07-17 22:50:57,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-17 22:50:57,214 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2895#true} {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #129#return; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {2895#true} call ULTIMATE.init(); {2908#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:57,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#(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; {2895#true} is VALID [2020-07-17 22:50:57,215 INFO L280 TraceCheckUtils]: 2: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-17 22:50:57,215 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2895#true} {2895#true} #133#return; {2895#true} is VALID [2020-07-17 22:50:57,216 INFO L263 TraceCheckUtils]: 4: Hoare triple {2895#true} call #t~ret21 := main(); {2895#true} is VALID [2020-07-17 22:50:57,216 INFO L280 TraceCheckUtils]: 5: Hoare triple {2895#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2895#true} is VALID [2020-07-17 22:50:57,216 INFO L263 TraceCheckUtils]: 6: Hoare triple {2895#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2895#true} is VALID [2020-07-17 22:50:57,217 INFO L280 TraceCheckUtils]: 7: Hoare triple {2895#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); {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,218 INFO L280 TraceCheckUtils]: 9: Hoare triple {2900#(= 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; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume !#t~switch4; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,219 INFO L280 TraceCheckUtils]: 11: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} havoc #t~mem3;havoc #t~switch4; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,221 INFO L280 TraceCheckUtils]: 12: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,221 INFO L280 TraceCheckUtils]: 13: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem1);havoc #t~mem1; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,222 INFO L280 TraceCheckUtils]: 14: Hoare triple {2900#(= 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; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume #t~switch4; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,230 INFO L280 TraceCheckUtils]: 16: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,231 INFO L280 TraceCheckUtils]: 17: Hoare triple {2900#(= 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; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,232 INFO L280 TraceCheckUtils]: 18: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,232 INFO L280 TraceCheckUtils]: 19: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,233 INFO L280 TraceCheckUtils]: 20: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume !(34 == #t~mem9);havoc #t~mem9; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,233 INFO L280 TraceCheckUtils]: 21: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:57,234 INFO L280 TraceCheckUtils]: 22: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {2901#(or (and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0)) |parse_expression_list_#t~short14|)} is VALID [2020-07-17 22:50:57,235 INFO L280 TraceCheckUtils]: 23: Hoare triple {2901#(or (and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0)) |parse_expression_list_#t~short14|)} assume !#t~short14; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,235 INFO L280 TraceCheckUtils]: 24: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,236 INFO L280 TraceCheckUtils]: 25: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,237 INFO L280 TraceCheckUtils]: 26: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,238 INFO L280 TraceCheckUtils]: 27: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,238 INFO L280 TraceCheckUtils]: 28: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,239 INFO L263 TraceCheckUtils]: 29: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} 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)); {2895#true} is VALID [2020-07-17 22:50:57,239 INFO L280 TraceCheckUtils]: 30: Hoare triple {2895#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; {2895#true} is VALID [2020-07-17 22:50:57,239 INFO L280 TraceCheckUtils]: 31: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-17 22:50:57,242 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2895#true} {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #129#return; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,243 INFO L280 TraceCheckUtils]: 33: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~ret19.base, #t~ret19.offset; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:57,244 INFO L263 TraceCheckUtils]: 34: Hoare triple {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2906#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:57,244 INFO L280 TraceCheckUtils]: 35: Hoare triple {2906#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2907#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:57,245 INFO L280 TraceCheckUtils]: 36: Hoare triple {2907#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2896#false} is VALID [2020-07-17 22:50:57,245 INFO L280 TraceCheckUtils]: 37: Hoare triple {2896#false} assume !false; {2896#false} is VALID [2020-07-17 22:50:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:50:57,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484577122] [2020-07-17 22:50:57,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:57,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:50:57,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33648160] [2020-07-17 22:50:57,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-17 22:50:57,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:57,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:57,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:57,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:57,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:57,292 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 8 states. [2020-07-17 22:50:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,010 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2020-07-17 22:50:58,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:50:58,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-17 22:50:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2020-07-17 22:50:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2020-07-17 22:50:58,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2020-07-17 22:50:58,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:58,151 INFO L225 Difference]: With dead ends: 107 [2020-07-17 22:50:58,152 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 22:50:58,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:50:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 22:50:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-07-17 22:50:58,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:58,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 93 states. [2020-07-17 22:50:58,203 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 93 states. [2020-07-17 22:50:58,203 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 93 states. [2020-07-17 22:50:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,212 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2020-07-17 22:50:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2020-07-17 22:50:58,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,213 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 105 states. [2020-07-17 22:50:58,213 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 105 states. [2020-07-17 22:50:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,219 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2020-07-17 22:50:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2020-07-17 22:50:58,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:58,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-17 22:50:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-07-17 22:50:58,225 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 38 [2020-07-17 22:50:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:58,226 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-07-17 22:50:58,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-17 22:50:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:50:58,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:58,227 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:58,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:50:58,228 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash 888728936, now seen corresponding path program 1 times [2020-07-17 22:50:58,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:58,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669135490] [2020-07-17 22:50:58,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {3388#(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; {3375#true} is VALID [2020-07-17 22:50:58,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:50:58,385 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3375#true} {3375#true} #133#return; {3375#true} is VALID [2020-07-17 22:50:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {3375#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; {3375#true} is VALID [2020-07-17 22:50:58,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:50:58,396 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3375#true} {3376#false} #129#return; {3376#false} is VALID [2020-07-17 22:50:58,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:58,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {3388#(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; {3375#true} is VALID [2020-07-17 22:50:58,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:50:58,398 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #133#return; {3375#true} is VALID [2020-07-17 22:50:58,398 INFO L263 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret21 := main(); {3375#true} is VALID [2020-07-17 22:50:58,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {3375#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3375#true} is VALID [2020-07-17 22:50:58,398 INFO L263 TraceCheckUtils]: 6: Hoare triple {3375#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3375#true} is VALID [2020-07-17 22:50:58,399 INFO L280 TraceCheckUtils]: 7: Hoare triple {3375#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); {3380#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-17 22:50:58,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {3380#(<= (+ parse_expression_list_~i~0 1) 0)} assume !(~str.base == 0 && ~str.offset == 0); {3380#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-17 22:50:58,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {3380#(<= (+ 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; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} assume !#t~switch4; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} havoc #t~mem3;havoc #t~switch4; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} assume !!(0 != #t~mem1);havoc #t~mem1; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {3381#(<= parse_expression_list_~i~0 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; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume #t~switch4; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,408 INFO L280 TraceCheckUtils]: 18: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,409 INFO L280 TraceCheckUtils]: 19: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,409 INFO L280 TraceCheckUtils]: 20: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,410 INFO L280 TraceCheckUtils]: 21: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} ~j~0 := ~i~0 - 1; {3383#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-17 22:50:58,411 INFO L280 TraceCheckUtils]: 22: Hoare triple {3383#(<= parse_expression_list_~j~0 0)} #t~short14 := 0 < ~j~0; {3384#(not |parse_expression_list_#t~short14|)} is VALID [2020-07-17 22:50:58,411 INFO L280 TraceCheckUtils]: 23: Hoare triple {3384#(not |parse_expression_list_#t~short14|)} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {3376#false} is VALID [2020-07-17 22:50:58,411 INFO L280 TraceCheckUtils]: 24: Hoare triple {3376#false} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {3376#false} is VALID [2020-07-17 22:50:58,412 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#false} #t~short14 := #t~short13; {3376#false} is VALID [2020-07-17 22:50:58,412 INFO L280 TraceCheckUtils]: 26: Hoare triple {3376#false} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {3376#false} is VALID [2020-07-17 22:50:58,412 INFO L280 TraceCheckUtils]: 27: Hoare triple {3376#false} #t~short17 := 0 < ~j~0; {3376#false} is VALID [2020-07-17 22:50:58,412 INFO L280 TraceCheckUtils]: 28: Hoare triple {3376#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {3376#false} is VALID [2020-07-17 22:50:58,412 INFO L280 TraceCheckUtils]: 29: Hoare triple {3376#false} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {3376#false} is VALID [2020-07-17 22:50:58,413 INFO L280 TraceCheckUtils]: 30: Hoare triple {3376#false} assume ~start~0 <= ~j~0; {3376#false} is VALID [2020-07-17 22:50:58,413 INFO L263 TraceCheckUtils]: 31: Hoare triple {3376#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)); {3375#true} is VALID [2020-07-17 22:50:58,413 INFO L280 TraceCheckUtils]: 32: Hoare triple {3375#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; {3375#true} is VALID [2020-07-17 22:50:58,413 INFO L280 TraceCheckUtils]: 33: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:50:58,413 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3375#true} {3376#false} #129#return; {3376#false} is VALID [2020-07-17 22:50:58,414 INFO L280 TraceCheckUtils]: 35: Hoare triple {3376#false} havoc #t~ret19.base, #t~ret19.offset; {3376#false} is VALID [2020-07-17 22:50:58,414 INFO L263 TraceCheckUtils]: 36: Hoare triple {3376#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3376#false} is VALID [2020-07-17 22:50:58,414 INFO L280 TraceCheckUtils]: 37: Hoare triple {3376#false} ~cond := #in~cond; {3376#false} is VALID [2020-07-17 22:50:58,414 INFO L280 TraceCheckUtils]: 38: Hoare triple {3376#false} assume 0 == ~cond; {3376#false} is VALID [2020-07-17 22:50:58,414 INFO L280 TraceCheckUtils]: 39: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2020-07-17 22:50:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:58,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669135490] [2020-07-17 22:50:58,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60341514] [2020-07-17 22:50:58,419 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-17 22:50:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:58,611 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:58,633 INFO L263 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2020-07-17 22:50:58,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3375#true} is VALID [2020-07-17 22:50:58,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-17 22:50:58,634 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #133#return; {3375#true} is VALID [2020-07-17 22:50:58,634 INFO L263 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret21 := main(); {3375#true} is VALID [2020-07-17 22:50:58,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {3375#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3375#true} is VALID [2020-07-17 22:50:58,634 INFO L263 TraceCheckUtils]: 6: Hoare triple {3375#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3375#true} is VALID [2020-07-17 22:50:58,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {3375#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); {3380#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-17 22:50:58,636 INFO L280 TraceCheckUtils]: 8: Hoare triple {3380#(<= (+ parse_expression_list_~i~0 1) 0)} assume !(~str.base == 0 && ~str.offset == 0); {3380#(<= (+ parse_expression_list_~i~0 1) 0)} is VALID [2020-07-17 22:50:58,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {3380#(<= (+ 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; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,638 INFO L280 TraceCheckUtils]: 10: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} assume !#t~switch4; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} havoc #t~mem3;havoc #t~switch4; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,639 INFO L280 TraceCheckUtils]: 12: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {3381#(<= parse_expression_list_~i~0 0)} assume !!(0 != #t~mem1);havoc #t~mem1; {3381#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-17 22:50:58,641 INFO L280 TraceCheckUtils]: 14: Hoare triple {3381#(<= parse_expression_list_~i~0 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; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume #t~switch4; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,642 INFO L280 TraceCheckUtils]: 17: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,643 INFO L280 TraceCheckUtils]: 18: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,643 INFO L280 TraceCheckUtils]: 19: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,644 INFO L280 TraceCheckUtils]: 20: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-17 22:50:58,645 INFO L280 TraceCheckUtils]: 21: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} ~j~0 := ~i~0 - 1; {3383#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-17 22:50:58,645 INFO L280 TraceCheckUtils]: 22: Hoare triple {3383#(<= parse_expression_list_~j~0 0)} #t~short14 := 0 < ~j~0; {3384#(not |parse_expression_list_#t~short14|)} is VALID [2020-07-17 22:50:58,646 INFO L280 TraceCheckUtils]: 23: Hoare triple {3384#(not |parse_expression_list_#t~short14|)} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {3376#false} is VALID [2020-07-17 22:50:58,646 INFO L280 TraceCheckUtils]: 24: Hoare triple {3376#false} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {3376#false} is VALID [2020-07-17 22:50:58,646 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#false} #t~short14 := #t~short13; {3376#false} is VALID [2020-07-17 22:50:58,647 INFO L280 TraceCheckUtils]: 26: Hoare triple {3376#false} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {3376#false} is VALID [2020-07-17 22:50:58,647 INFO L280 TraceCheckUtils]: 27: Hoare triple {3376#false} #t~short17 := 0 < ~j~0; {3376#false} is VALID [2020-07-17 22:50:58,647 INFO L280 TraceCheckUtils]: 28: Hoare triple {3376#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {3376#false} is VALID [2020-07-17 22:50:58,647 INFO L280 TraceCheckUtils]: 29: Hoare triple {3376#false} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {3376#false} is VALID [2020-07-17 22:50:58,647 INFO L280 TraceCheckUtils]: 30: Hoare triple {3376#false} assume ~start~0 <= ~j~0; {3376#false} is VALID [2020-07-17 22:50:58,648 INFO L263 TraceCheckUtils]: 31: Hoare triple {3376#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)); {3376#false} is VALID [2020-07-17 22:50:58,648 INFO L280 TraceCheckUtils]: 32: Hoare triple {3376#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; {3376#false} is VALID [2020-07-17 22:50:58,648 INFO L280 TraceCheckUtils]: 33: Hoare triple {3376#false} assume true; {3376#false} is VALID [2020-07-17 22:50:58,648 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3376#false} {3376#false} #129#return; {3376#false} is VALID [2020-07-17 22:50:58,649 INFO L280 TraceCheckUtils]: 35: Hoare triple {3376#false} havoc #t~ret19.base, #t~ret19.offset; {3376#false} is VALID [2020-07-17 22:50:58,649 INFO L263 TraceCheckUtils]: 36: Hoare triple {3376#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3376#false} is VALID [2020-07-17 22:50:58,649 INFO L280 TraceCheckUtils]: 37: Hoare triple {3376#false} ~cond := #in~cond; {3376#false} is VALID [2020-07-17 22:50:58,649 INFO L280 TraceCheckUtils]: 38: Hoare triple {3376#false} assume 0 == ~cond; {3376#false} is VALID [2020-07-17 22:50:58,649 INFO L280 TraceCheckUtils]: 39: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2020-07-17 22:50:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:58,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:58,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2020-07-17 22:50:58,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527747184] [2020-07-17 22:50:58,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-17 22:50:58,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:58,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:58,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:58,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:58,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:58,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:58,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:58,712 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 8 states. [2020-07-17 22:50:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,375 INFO L93 Difference]: Finished difference Result 209 states and 263 transitions. [2020-07-17 22:50:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:50:59,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-17 22:50:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2020-07-17 22:50:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2020-07-17 22:50:59,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 148 transitions. [2020-07-17 22:50:59,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:59,559 INFO L225 Difference]: With dead ends: 209 [2020-07-17 22:50:59,559 INFO L226 Difference]: Without dead ends: 136 [2020-07-17 22:50:59,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:50:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-17 22:50:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 106. [2020-07-17 22:50:59,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:59,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 106 states. [2020-07-17 22:50:59,611 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 106 states. [2020-07-17 22:50:59,611 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 106 states. [2020-07-17 22:50:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,616 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-17 22:50:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-17 22:50:59,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:59,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:59,617 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 136 states. [2020-07-17 22:50:59,617 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 136 states. [2020-07-17 22:50:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,620 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-17 22:50:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-17 22:50:59,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:59,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:59,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:59,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 22:50:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2020-07-17 22:50:59,624 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 40 [2020-07-17 22:50:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:59,624 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2020-07-17 22:50:59,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2020-07-17 22:50:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 22:50:59,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:59,625 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 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] [2020-07-17 22:50:59,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-17 22:50:59,841 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1526927005, now seen corresponding path program 2 times [2020-07-17 22:50:59,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:59,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188256956] [2020-07-17 22:50:59,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {4190#(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; {4173#true} is VALID [2020-07-17 22:51:00,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-17 22:51:00,020 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4173#true} {4173#true} #133#return; {4173#true} is VALID [2020-07-17 22:51:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {4173#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; {4173#true} is VALID [2020-07-17 22:51:00,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-17 22:51:00,042 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4173#true} {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} #129#return; {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {4173#true} call ULTIMATE.init(); {4190#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:00,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {4190#(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; {4173#true} is VALID [2020-07-17 22:51:00,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-17 22:51:00,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4173#true} {4173#true} #133#return; {4173#true} is VALID [2020-07-17 22:51:00,044 INFO L263 TraceCheckUtils]: 4: Hoare triple {4173#true} call #t~ret21 := main(); {4173#true} is VALID [2020-07-17 22:51:00,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {4173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4173#true} is VALID [2020-07-17 22:51:00,044 INFO L263 TraceCheckUtils]: 6: Hoare triple {4173#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4173#true} is VALID [2020-07-17 22:51:00,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {4173#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); {4178#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:00,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {4178#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {4178#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:00,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {4178#(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; {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,050 INFO L280 TraceCheckUtils]: 10: Hoare triple {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~switch4; {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem3;havoc #t~switch4; {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,052 INFO L280 TraceCheckUtils]: 12: Hoare triple {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !!(0 != #t~mem1);havoc #t~mem1; {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {4179#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 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; {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,054 INFO L280 TraceCheckUtils]: 15: Hoare triple {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !#t~switch4; {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,055 INFO L280 TraceCheckUtils]: 16: Hoare triple {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} havoc #t~mem3;havoc #t~switch4; {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,056 INFO L280 TraceCheckUtils]: 17: Hoare triple {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,057 INFO L280 TraceCheckUtils]: 18: Hoare triple {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !!(0 != #t~mem1);havoc #t~mem1; {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,058 INFO L280 TraceCheckUtils]: 19: Hoare triple {4180#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} #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; {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume #t~switch4; {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,060 INFO L280 TraceCheckUtils]: 21: Hoare triple {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,061 INFO L280 TraceCheckUtils]: 22: Hoare triple {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,062 INFO L280 TraceCheckUtils]: 23: Hoare triple {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,063 INFO L280 TraceCheckUtils]: 24: Hoare triple {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {4182#(<= parse_expression_list_~i~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-17 22:51:00,065 INFO L280 TraceCheckUtils]: 26: Hoare triple {4182#(<= parse_expression_list_~i~0 (+ parse_expression_list_~start~0 1))} ~j~0 := ~i~0 - 1; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,066 INFO L280 TraceCheckUtils]: 27: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,066 INFO L280 TraceCheckUtils]: 28: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,067 INFO L280 TraceCheckUtils]: 29: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,068 INFO L280 TraceCheckUtils]: 30: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} #t~short14 := #t~short13; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,069 INFO L280 TraceCheckUtils]: 31: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,069 INFO L280 TraceCheckUtils]: 32: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} #t~short17 := 0 < ~j~0; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,070 INFO L280 TraceCheckUtils]: 33: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,071 INFO L280 TraceCheckUtils]: 34: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,072 INFO L280 TraceCheckUtils]: 35: Hoare triple {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume ~start~0 <= ~j~0; {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,072 INFO L263 TraceCheckUtils]: 36: Hoare triple {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} 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)); {4173#true} is VALID [2020-07-17 22:51:00,072 INFO L280 TraceCheckUtils]: 37: Hoare triple {4173#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; {4173#true} is VALID [2020-07-17 22:51:00,072 INFO L280 TraceCheckUtils]: 38: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-17 22:51:00,074 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4173#true} {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} #129#return; {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,074 INFO L280 TraceCheckUtils]: 40: Hoare triple {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} havoc #t~ret19.base, #t~ret19.offset; {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-17 22:51:00,075 INFO L263 TraceCheckUtils]: 41: Hoare triple {4184#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4188#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:00,076 INFO L280 TraceCheckUtils]: 42: Hoare triple {4188#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4189#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:00,077 INFO L280 TraceCheckUtils]: 43: Hoare triple {4189#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4174#false} is VALID [2020-07-17 22:51:00,077 INFO L280 TraceCheckUtils]: 44: Hoare triple {4174#false} assume !false; {4174#false} is VALID [2020-07-17 22:51:00,082 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-17 22:51:00,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188256956] [2020-07-17 22:51:00,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852766968] [2020-07-17 22:51:00,083 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 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-17 22:51:00,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:51:00,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:00,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:51:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:00,437 INFO L263 TraceCheckUtils]: 0: Hoare triple {4173#true} call ULTIMATE.init(); {4173#true} is VALID [2020-07-17 22:51:00,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {4173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4173#true} is VALID [2020-07-17 22:51:00,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-17 22:51:00,437 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4173#true} {4173#true} #133#return; {4173#true} is VALID [2020-07-17 22:51:00,438 INFO L263 TraceCheckUtils]: 4: Hoare triple {4173#true} call #t~ret21 := main(); {4173#true} is VALID [2020-07-17 22:51:00,438 INFO L280 TraceCheckUtils]: 5: Hoare triple {4173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4173#true} is VALID [2020-07-17 22:51:00,438 INFO L263 TraceCheckUtils]: 6: Hoare triple {4173#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4173#true} is VALID [2020-07-17 22:51:00,439 INFO L280 TraceCheckUtils]: 7: Hoare triple {4173#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); {4215#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:00,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {4215#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {4215#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:00,442 INFO L280 TraceCheckUtils]: 9: Hoare triple {4215#(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; {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,442 INFO L280 TraceCheckUtils]: 10: Hoare triple {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~switch4; {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,443 INFO L280 TraceCheckUtils]: 11: Hoare triple {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem3;havoc #t~switch4; {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,444 INFO L280 TraceCheckUtils]: 12: Hoare triple {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,444 INFO L280 TraceCheckUtils]: 13: Hoare triple {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !!(0 != #t~mem1);havoc #t~mem1; {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:00,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {4222#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 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; {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,447 INFO L280 TraceCheckUtils]: 15: Hoare triple {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !#t~switch4; {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,447 INFO L280 TraceCheckUtils]: 16: Hoare triple {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} havoc #t~mem3;havoc #t~switch4; {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,448 INFO L280 TraceCheckUtils]: 17: Hoare triple {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,449 INFO L280 TraceCheckUtils]: 18: Hoare triple {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !!(0 != #t~mem1);havoc #t~mem1; {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:00,450 INFO L280 TraceCheckUtils]: 19: Hoare triple {4238#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} #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; {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,451 INFO L280 TraceCheckUtils]: 20: Hoare triple {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume #t~switch4; {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,451 INFO L280 TraceCheckUtils]: 21: Hoare triple {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,452 INFO L280 TraceCheckUtils]: 22: Hoare triple {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,453 INFO L280 TraceCheckUtils]: 23: Hoare triple {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,453 INFO L280 TraceCheckUtils]: 24: Hoare triple {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,454 INFO L280 TraceCheckUtils]: 25: Hoare triple {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {4273#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:00,455 INFO L280 TraceCheckUtils]: 26: Hoare triple {4273#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} ~j~0 := ~i~0 - 1; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,456 INFO L280 TraceCheckUtils]: 27: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short14 := 0 < ~j~0; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,457 INFO L280 TraceCheckUtils]: 28: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,457 INFO L280 TraceCheckUtils]: 29: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,458 INFO L280 TraceCheckUtils]: 30: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short14 := #t~short13; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,459 INFO L280 TraceCheckUtils]: 31: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,459 INFO L280 TraceCheckUtils]: 32: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short17 := 0 < ~j~0; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,460 INFO L280 TraceCheckUtils]: 33: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:00,461 INFO L280 TraceCheckUtils]: 34: Hoare triple {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {4302#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:00,461 INFO L280 TraceCheckUtils]: 35: Hoare triple {4302#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {4174#false} is VALID [2020-07-17 22:51:00,462 INFO L263 TraceCheckUtils]: 36: Hoare triple {4174#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)); {4174#false} is VALID [2020-07-17 22:51:00,462 INFO L280 TraceCheckUtils]: 37: Hoare triple {4174#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; {4174#false} is VALID [2020-07-17 22:51:00,462 INFO L280 TraceCheckUtils]: 38: Hoare triple {4174#false} assume true; {4174#false} is VALID [2020-07-17 22:51:00,462 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4174#false} {4174#false} #129#return; {4174#false} is VALID [2020-07-17 22:51:00,462 INFO L280 TraceCheckUtils]: 40: Hoare triple {4174#false} havoc #t~ret19.base, #t~ret19.offset; {4174#false} is VALID [2020-07-17 22:51:00,463 INFO L263 TraceCheckUtils]: 41: Hoare triple {4174#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4174#false} is VALID [2020-07-17 22:51:00,463 INFO L280 TraceCheckUtils]: 42: Hoare triple {4174#false} ~cond := #in~cond; {4174#false} is VALID [2020-07-17 22:51:00,463 INFO L280 TraceCheckUtils]: 43: Hoare triple {4174#false} assume 0 == ~cond; {4174#false} is VALID [2020-07-17 22:51:00,463 INFO L280 TraceCheckUtils]: 44: Hoare triple {4174#false} assume !false; {4174#false} is VALID [2020-07-17 22:51:00,466 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-17 22:51:00,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:00,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2020-07-17 22:51:00,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281522304] [2020-07-17 22:51:00,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-17 22:51:00,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:00,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:51:00,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:00,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:51:00,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:51:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:51:00,566 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand 19 states. [2020-07-17 22:51:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,806 INFO L93 Difference]: Finished difference Result 240 states and 302 transitions. [2020-07-17 22:51:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:51:02,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-17 22:51:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:51:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 229 transitions. [2020-07-17 22:51:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:51:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 229 transitions. [2020-07-17 22:51:02,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 229 transitions. [2020-07-17 22:51:03,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:03,091 INFO L225 Difference]: With dead ends: 240 [2020-07-17 22:51:03,091 INFO L226 Difference]: Without dead ends: 189 [2020-07-17 22:51:03,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2020-07-17 22:51:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-17 22:51:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 127. [2020-07-17 22:51:03,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:03,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 127 states. [2020-07-17 22:51:03,147 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 127 states. [2020-07-17 22:51:03,148 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 127 states. [2020-07-17 22:51:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:03,153 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2020-07-17 22:51:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2020-07-17 22:51:03,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:03,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:03,154 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 189 states. [2020-07-17 22:51:03,154 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 189 states. [2020-07-17 22:51:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:03,159 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2020-07-17 22:51:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2020-07-17 22:51:03,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:03,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:03,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:03,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-07-17 22:51:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2020-07-17 22:51:03,163 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 45 [2020-07-17 22:51:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:03,163 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2020-07-17 22:51:03,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:51:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2020-07-17 22:51:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 22:51:03,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:03,165 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 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] [2020-07-17 22:51:03,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 22:51:03,378 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash 709278555, now seen corresponding path program 1 times [2020-07-17 22:51:03,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:03,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89125665] [2020-07-17 22:51:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:03,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {5192#(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; {5176#true} is VALID [2020-07-17 22:51:03,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-17 22:51:03,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5176#true} {5176#true} #133#return; {5176#true} is VALID [2020-07-17 22:51:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:03,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {5176#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; {5176#true} is VALID [2020-07-17 22:51:03,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-17 22:51:03,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5176#true} {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #129#return; {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:03,544 INFO L263 TraceCheckUtils]: 0: Hoare triple {5176#true} call ULTIMATE.init(); {5192#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:03,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {5192#(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; {5176#true} is VALID [2020-07-17 22:51:03,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-17 22:51:03,544 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5176#true} {5176#true} #133#return; {5176#true} is VALID [2020-07-17 22:51:03,544 INFO L263 TraceCheckUtils]: 4: Hoare triple {5176#true} call #t~ret21 := main(); {5176#true} is VALID [2020-07-17 22:51:03,545 INFO L280 TraceCheckUtils]: 5: Hoare triple {5176#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5176#true} is VALID [2020-07-17 22:51:03,545 INFO L263 TraceCheckUtils]: 6: Hoare triple {5176#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5176#true} is VALID [2020-07-17 22:51:03,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {5176#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); {5181#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:03,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {5181#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {5181#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:03,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {5181#(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; {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~switch4; {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,562 INFO L280 TraceCheckUtils]: 11: Hoare triple {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem3;havoc #t~switch4; {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,563 INFO L280 TraceCheckUtils]: 12: Hoare triple {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,563 INFO L280 TraceCheckUtils]: 13: Hoare triple {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !!(0 != #t~mem1);havoc #t~mem1; {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,564 INFO L280 TraceCheckUtils]: 14: Hoare triple {5182#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 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; {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,565 INFO L280 TraceCheckUtils]: 15: Hoare triple {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !#t~switch4; {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,565 INFO L280 TraceCheckUtils]: 16: Hoare triple {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} havoc #t~mem3;havoc #t~switch4; {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,566 INFO L280 TraceCheckUtils]: 18: Hoare triple {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !!(0 != #t~mem1);havoc #t~mem1; {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,567 INFO L280 TraceCheckUtils]: 19: Hoare triple {5183#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} #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; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume #t~switch4; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,570 INFO L280 TraceCheckUtils]: 22: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,571 INFO L280 TraceCheckUtils]: 23: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,571 INFO L280 TraceCheckUtils]: 24: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,572 INFO L280 TraceCheckUtils]: 25: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !(34 == #t~mem9);havoc #t~mem9; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,573 INFO L280 TraceCheckUtils]: 26: Hoare triple {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} ~j~0 := ~i~0 - 1; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,573 INFO L280 TraceCheckUtils]: 27: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short14 := 0 < ~j~0; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,574 INFO L280 TraceCheckUtils]: 28: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,574 INFO L280 TraceCheckUtils]: 29: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,575 INFO L280 TraceCheckUtils]: 30: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short14 := #t~short13; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,576 INFO L280 TraceCheckUtils]: 31: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,576 INFO L280 TraceCheckUtils]: 32: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short17 := 0 < ~j~0; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,577 INFO L280 TraceCheckUtils]: 33: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,577 INFO L280 TraceCheckUtils]: 34: Hoare triple {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:03,578 INFO L280 TraceCheckUtils]: 35: Hoare triple {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:03,578 INFO L263 TraceCheckUtils]: 36: Hoare triple {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} 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)); {5176#true} is VALID [2020-07-17 22:51:03,578 INFO L280 TraceCheckUtils]: 37: Hoare triple {5176#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; {5176#true} is VALID [2020-07-17 22:51:03,578 INFO L280 TraceCheckUtils]: 38: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-17 22:51:03,579 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5176#true} {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #129#return; {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:03,581 INFO L280 TraceCheckUtils]: 40: Hoare triple {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~ret19.base, #t~ret19.offset; {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:03,582 INFO L263 TraceCheckUtils]: 41: Hoare triple {5186#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5190#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:03,583 INFO L280 TraceCheckUtils]: 42: Hoare triple {5190#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5191#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:03,585 INFO L280 TraceCheckUtils]: 43: Hoare triple {5191#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5177#false} is VALID [2020-07-17 22:51:03,585 INFO L280 TraceCheckUtils]: 44: Hoare triple {5177#false} assume !false; {5177#false} is VALID [2020-07-17 22:51:03,588 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-17 22:51:03,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89125665] [2020-07-17 22:51:03,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118408340] [2020-07-17 22:51:03,589 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-17 22:51:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:03,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:51:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:03,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:03,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:03,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:03,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {5176#true} call ULTIMATE.init(); {5176#true} is VALID [2020-07-17 22:51:03,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {5176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5176#true} is VALID [2020-07-17 22:51:03,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-17 22:51:03,975 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5176#true} {5176#true} #133#return; {5176#true} is VALID [2020-07-17 22:51:03,975 INFO L263 TraceCheckUtils]: 4: Hoare triple {5176#true} call #t~ret21 := main(); {5176#true} is VALID [2020-07-17 22:51:03,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {5176#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5176#true} is VALID [2020-07-17 22:51:03,975 INFO L263 TraceCheckUtils]: 6: Hoare triple {5176#true} call #t~ret20 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5176#true} is VALID [2020-07-17 22:51:03,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {5176#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); {5217#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:03,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {5217#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {5217#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:51:03,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {5217#(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; {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~switch4; {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} havoc #t~mem3;havoc #t~switch4; {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,979 INFO L280 TraceCheckUtils]: 13: Hoare triple {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !!(0 != #t~mem1);havoc #t~mem1; {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:51:03,980 INFO L280 TraceCheckUtils]: 14: Hoare triple {5224#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 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; {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !#t~switch4; {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} havoc #t~mem3;havoc #t~switch4; {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,984 INFO L280 TraceCheckUtils]: 18: Hoare triple {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} assume !!(0 != #t~mem1);havoc #t~mem1; {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} is VALID [2020-07-17 22:51:03,985 INFO L280 TraceCheckUtils]: 19: Hoare triple {5240#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 1))} #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; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,985 INFO L280 TraceCheckUtils]: 20: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume #t~switch4; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,986 INFO L280 TraceCheckUtils]: 21: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,986 INFO L280 TraceCheckUtils]: 22: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !#t~short7;havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,988 INFO L280 TraceCheckUtils]: 24: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,989 INFO L280 TraceCheckUtils]: 25: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} assume !(34 == #t~mem9);havoc #t~mem9; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-17 22:51:03,993 INFO L280 TraceCheckUtils]: 26: Hoare triple {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} ~j~0 := ~i~0 - 1; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,996 INFO L280 TraceCheckUtils]: 27: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short14 := 0 < ~j~0; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,996 INFO L280 TraceCheckUtils]: 28: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short14;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 32 == #t~mem11; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,997 INFO L280 TraceCheckUtils]: 29: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume !#t~short13;call #t~mem12 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short13 := 9 == #t~mem12; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,997 INFO L280 TraceCheckUtils]: 30: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short14 := #t~short13; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,998 INFO L280 TraceCheckUtils]: 31: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume !#t~short14;havoc #t~mem12;havoc #t~short13;havoc #t~short14;havoc #t~mem11; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,998 INFO L280 TraceCheckUtils]: 32: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} #t~short17 := 0 < ~j~0; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:03,999 INFO L280 TraceCheckUtils]: 33: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-17 22:51:04,000 INFO L280 TraceCheckUtils]: 34: Hoare triple {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} assume #t~short17;havoc #t~short17;havoc #t~mem16;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:04,000 INFO L280 TraceCheckUtils]: 35: Hoare triple {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:04,000 INFO L263 TraceCheckUtils]: 36: Hoare triple {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} 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)); {5176#true} is VALID [2020-07-17 22:51:04,000 INFO L280 TraceCheckUtils]: 37: Hoare triple {5176#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; {5176#true} is VALID [2020-07-17 22:51:04,000 INFO L280 TraceCheckUtils]: 38: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-17 22:51:04,001 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5176#true} {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #129#return; {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:04,002 INFO L280 TraceCheckUtils]: 40: Hoare triple {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} havoc #t~ret19.base, #t~ret19.offset; {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:51:04,003 INFO L263 TraceCheckUtils]: 41: Hoare triple {5303#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:04,003 INFO L280 TraceCheckUtils]: 42: Hoare triple {5325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:04,004 INFO L280 TraceCheckUtils]: 43: Hoare triple {5329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5177#false} is VALID [2020-07-17 22:51:04,004 INFO L280 TraceCheckUtils]: 44: Hoare triple {5177#false} assume !false; {5177#false} is VALID [2020-07-17 22:51:04,007 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-17 22:51:04,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:04,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-07-17 22:51:04,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003675465] [2020-07-17 22:51:04,008 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-17 22:51:04,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:04,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:51:04,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:04,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:51:04,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:51:04,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:51:04,107 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand 19 states. [2020-07-17 22:51:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:06,017 INFO L93 Difference]: Finished difference Result 212 states and 267 transitions. [2020-07-17 22:51:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:51:06,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-17 22:51:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:51:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 197 transitions. [2020-07-17 22:51:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:51:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 197 transitions. [2020-07-17 22:51:06,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 197 transitions. [2020-07-17 22:51:06,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:06,242 INFO L225 Difference]: With dead ends: 212 [2020-07-17 22:51:06,242 INFO L226 Difference]: Without dead ends: 210 [2020-07-17 22:51:06,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2020-07-17 22:51:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-17 22:51:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2020-07-17 22:51:06,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:06,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 146 states. [2020-07-17 22:51:06,309 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 146 states. [2020-07-17 22:51:06,309 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 146 states. [2020-07-17 22:51:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:06,315 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2020-07-17 22:51:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 265 transitions. [2020-07-17 22:51:06,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:06,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:06,316 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 210 states. [2020-07-17 22:51:06,316 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 210 states. [2020-07-17 22:51:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:06,322 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2020-07-17 22:51:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 265 transitions. [2020-07-17 22:51:06,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:06,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:06,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:06,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-07-17 22:51:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2020-07-17 22:51:06,328 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 45 [2020-07-17 22:51:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:06,328 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2020-07-17 22:51:06,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:51:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2020-07-17 22:51:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 22:51:06,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:06,329 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 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] [2020-07-17 22:51:06,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-17 22:51:06,543 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1410343133, now seen corresponding path program 1 times [2020-07-17 22:51:06,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:06,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201792728] [2020-07-17 22:51:06,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:51:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:51:06,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:51:06,606 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:51:06,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:51:06,639 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,641 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,642 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,642 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,643 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,643 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,644 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,645 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,645 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,646 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,647 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-07-17 22:51:06,657 WARN L170 areAnnotationChecker]: parse_expression_listENTRY has no Hoare annotation [2020-07-17 22:51:06,657 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:51:06,657 WARN L170 areAnnotationChecker]: r_strncpyENTRY has no Hoare annotation [2020-07-17 22:51:06,657 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:51:06,658 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2020-07-17 22:51:06,659 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:51:06,660 WARN L170 areAnnotationChecker]: L51-5 has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-17 22:51:06,661 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-17 22:51:06,662 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L58-8 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L58-8 has no Hoare annotation [2020-07-17 22:51:06,663 WARN L170 areAnnotationChecker]: L58-9 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L58-6 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L58-6 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-17 22:51:06,664 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-17 22:51:06,665 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2020-07-17 22:51:06,665 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-17 22:51:06,665 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-17 22:51:06,665 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:51:06,665 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:51:06,665 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:06,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:06 BoogieIcfgContainer [2020-07-17 22:51:06,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:06,670 INFO L168 Benchmark]: Toolchain (without parser) took 17238.67 ms. Allocated memory was 139.5 MB in the beginning and 390.1 MB in the end (delta: 250.6 MB). Free memory was 103.8 MB in the beginning and 148.9 MB in the end (delta: -45.1 MB). Peak memory consumption was 205.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:06,671 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:06,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.50 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 103.4 MB in the beginning and 179.2 MB in the end (delta: -75.9 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:06,672 INFO L168 Benchmark]: Boogie Preprocessor took 59.16 ms. Allocated memory is still 202.9 MB. Free memory was 179.2 MB in the beginning and 176.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:06,672 INFO L168 Benchmark]: RCFGBuilder took 650.93 ms. Allocated memory is still 202.9 MB. Free memory was 176.5 MB in the beginning and 137.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:06,673 INFO L168 Benchmark]: TraceAbstraction took 16015.59 ms. Allocated memory was 202.9 MB in the beginning and 390.1 MB in the end (delta: 187.2 MB). Free memory was 136.7 MB in the beginning and 148.9 MB in the end (delta: -12.3 MB). Peak memory consumption was 174.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:06,675 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 504.50 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 103.4 MB in the beginning and 179.2 MB in the end (delta: -75.9 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.16 ms. Allocated memory is still 202.9 MB. Free memory was 179.2 MB in the beginning and 176.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 650.93 ms. Allocated memory is still 202.9 MB. Free memory was 176.5 MB in the beginning and 137.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16015.59 ms. Allocated memory was 202.9 MB in the beginning and 390.1 MB in the end (delta: 187.2 MB). Free memory was 136.7 MB in the beginning and 148.9 MB in the end (delta: -12.3 MB). Peak memory consumption was 174.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; [L75] A[2 + 2 + 4] = 0 VAL [A={4:0}] [L76] CALL parse_expression_list (A) VAL [str={4:0}] [L48] int start=0, i=-1, j=-1; [L49] char str2[2]; VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L50] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L52] i++ [L53] str[i] [L54] case 0: VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=-1] [L69] EXPR str[i] VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=-1] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=-2] [L69] EXPR str[i] VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=-2] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=-1, str[start]=-1] [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L56] EXPR str[start] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=-1] [L56] COND FALSE !(str[start] == '"') [L57] j = i-1 VAL [i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=-2, str[j]=-2] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=-2, str[j]=-2] [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L59] (0 < j) && (str[j] == '"') [L59] EXPR str[j] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=-2] [L59] COND FALSE !((0 < j) && (str[j] == '"')) [L60] COND TRUE start<=j VAL [i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L61] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={3:0}, src={4:0}] [L30] return strncpy(dest,src,n); [L61] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={35:37}, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L62] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.8s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 532 SDtfs, 963 SDslu, 1491 SDs, 0 SdLazy, 2100 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 219 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 68435 SizeOfPredicates, 8 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 2/42 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 incorrect! Received shutdown request...