/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-8fc6572 [2020-07-10 15:28:00,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:00,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:00,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:00,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:00,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:00,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:00,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:00,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:00,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:00,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:00,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:00,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:00,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:00,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:00,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:00,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:00,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:00,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:00,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:00,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:00,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:00,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:00,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:00,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:00,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:01,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:01,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:01,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:01,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:01,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:01,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:01,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:01,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:01,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:01,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:01,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:01,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:01,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:01,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:01,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:01,009 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-10 15:28:01,024 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:01,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:01,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:01,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:01,026 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:01,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:01,026 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:01,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:01,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:01,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:01,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:01,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:01,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:01,028 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:01,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:01,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:01,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:01,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:01,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:01,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:01,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:01,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:01,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:01,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:01,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:01,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:01,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:01,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:01,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:01,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:01,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:01,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:01,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:01,390 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:01,390 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:01,391 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-10 15:28:01,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f8c100b/1ce69c80a9e94b4996080d83fc804f89/FLAGe210facf1 [2020-07-10 15:28:01,913 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:01,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-10 15:28:01,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f8c100b/1ce69c80a9e94b4996080d83fc804f89/FLAGe210facf1 [2020-07-10 15:28:02,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f8c100b/1ce69c80a9e94b4996080d83fc804f89 [2020-07-10 15:28:02,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:02,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:02,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:02,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:02,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:02,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d75de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02, skipping insertion in model container [2020-07-10 15:28:02,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:02,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:02,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:02,529 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:02,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:02,585 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:02,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02 WrapperNode [2020-07-10 15:28:02,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:02,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:02,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:02,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:02,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (1/1) ... [2020-07-10 15:28:02,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:02,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:02,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:02,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:02,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (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-10 15:28:02,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:02,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:02,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:02,803 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-07-10 15:28:02,803 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-07-10 15:28:02,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-10 15:28:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-10 15:28:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-10 15:28:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-10 15:28:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-07-10 15:28:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-10 15:28:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-10 15:28:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-10 15:28:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-10 15:28:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-10 15:28:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-10 15:28:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-10 15:28:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-10 15:28:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-10 15:28:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-07-10 15:28:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-07-10 15:28:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-07-10 15:28:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-07-10 15:28:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-07-10 15:28:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:03,351 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:03,352 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:28:03,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:03 BoogieIcfgContainer [2020-07-10 15:28:03,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:03,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:03,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:03,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:03,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:02" (1/3) ... [2020-07-10 15:28:03,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b96c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:03, skipping insertion in model container [2020-07-10 15:28:03,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:02" (2/3) ... [2020-07-10 15:28:03,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b96c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:03, skipping insertion in model container [2020-07-10 15:28:03,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:03" (3/3) ... [2020-07-10 15:28:03,367 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-07-10 15:28:03,377 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:03,385 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:03,399 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:03,424 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:03,424 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:03,424 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:03,424 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:03,425 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:03,425 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:03,425 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:03,426 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-07-10 15:28:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:28:03,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:03,457 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-10 15:28:03,458 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2018987797, now seen corresponding path program 1 times [2020-07-10 15:28:03,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:03,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135429624] [2020-07-10 15:28:03,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:03,729 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-10 15:28:03,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-10 15:28:03,731 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #133#return; {54#true} is VALID [2020-07-10 15:28:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:03,747 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-10 15:28:03,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-10 15:28:03,748 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54#true} {55#false} #129#return; {55#false} is VALID [2020-07-10 15:28:03,750 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-10 15:28:03,751 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-10 15:28:03,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-10 15:28:03,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #133#return; {54#true} is VALID [2020-07-10 15:28:03,752 INFO L263 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret21 := main(); {54#true} is VALID [2020-07-10 15:28:03,752 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-10 15:28:03,753 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-10 15:28:03,753 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-10 15:28:03,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {54#true} assume !(~str.base == 0 && ~str.offset == 0); {54#true} is VALID [2020-07-10 15:28:03,754 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-10 15:28:03,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#true} assume #t~switch4; {54#true} is VALID [2020-07-10 15:28:03,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {54#true} assume !true; {55#false} is VALID [2020-07-10 15:28:03,756 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-10 15:28:03,756 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-10 15:28:03,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {55#false} ~j~0 := ~i~0 - 1; {55#false} is VALID [2020-07-10 15:28:03,757 INFO L280 TraceCheckUtils]: 15: Hoare triple {55#false} assume !true; {55#false} is VALID [2020-07-10 15:28:03,758 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#false} #t~short17 := 0 < ~j~0; {55#false} is VALID [2020-07-10 15:28:03,758 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-10 15:28:03,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {55#false} assume #t~short17;havoc #t~mem16;havoc #t~short17;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {55#false} is VALID [2020-07-10 15:28:03,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#false} assume ~start~0 <= ~j~0; {55#false} is VALID [2020-07-10 15:28:03,759 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-10 15:28:03,759 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-10 15:28:03,760 INFO L280 TraceCheckUtils]: 22: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-10 15:28:03,760 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {54#true} {55#false} #129#return; {55#false} is VALID [2020-07-10 15:28:03,760 INFO L280 TraceCheckUtils]: 24: Hoare triple {55#false} havoc #t~ret19.base, #t~ret19.offset; {55#false} is VALID [2020-07-10 15:28:03,761 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-10 15:28:03,761 INFO L280 TraceCheckUtils]: 26: Hoare triple {55#false} ~cond := #in~cond; {55#false} is VALID [2020-07-10 15:28:03,761 INFO L280 TraceCheckUtils]: 27: Hoare triple {55#false} assume 0 == ~cond; {55#false} is VALID [2020-07-10 15:28:03,762 INFO L280 TraceCheckUtils]: 28: Hoare triple {55#false} assume !false; {55#false} is VALID [2020-07-10 15:28:03,766 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-10 15:28:03,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135429624] [2020-07-10 15:28:03,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:03,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:28:03,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612952420] [2020-07-10 15:28:03,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:28:03,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:03,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:28:03,858 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-10 15:28:03,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:28:03,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:03,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:28:03,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:28:03,869 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-07-10 15:28:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:04,186 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2020-07-10 15:28:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:28:04,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:28:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2020-07-10 15:28:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2020-07-10 15:28:04,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2020-07-10 15:28:04,367 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-10 15:28:04,381 INFO L225 Difference]: With dead ends: 93 [2020-07-10 15:28:04,381 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 15:28:04,385 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-10 15:28:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 15:28:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-10 15:28:04,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:04,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:04,451 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:04,451 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:04,456 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-10 15:28:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-10 15:28:04,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:04,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:04,458 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:04,458 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:04,463 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-10 15:28:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-10 15:28:04,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:04,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:04,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:04,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:28:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-07-10 15:28:04,470 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2020-07-10 15:28:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:04,471 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-10 15:28:04,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:28:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-10 15:28:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:28:04,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:04,473 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-10 15:28:04,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:04,474 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash -171780126, now seen corresponding path program 1 times [2020-07-10 15:28:04,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:04,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782937901] [2020-07-10 15:28:04,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,645 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-10 15:28:04,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:28:04,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #133#return; {320#true} is VALID [2020-07-10 15:28:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:04,663 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-10 15:28:04,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:28:04,664 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {321#false} #129#return; {321#false} is VALID [2020-07-10 15:28:04,665 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-10 15:28:04,666 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-10 15:28:04,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:28:04,666 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #133#return; {320#true} is VALID [2020-07-10 15:28:04,667 INFO L263 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret21 := main(); {320#true} is VALID [2020-07-10 15:28:04,667 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-10 15:28:04,668 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-10 15:28:04,669 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-10 15:28:04,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#true} assume !(~str.base == 0 && ~str.offset == 0); {320#true} is VALID [2020-07-10 15:28:04,672 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-10 15:28:04,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {320#true} assume #t~switch4; {320#true} is VALID [2020-07-10 15:28:04,673 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-10 15:28:04,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {320#true} assume #t~short7; {325#|parse_expression_list_#t~short7|} is VALID [2020-07-10 15:28:04,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {325#|parse_expression_list_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {321#false} is VALID [2020-07-10 15:28:04,675 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-10 15:28:04,675 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-10 15:28:04,675 INFO L280 TraceCheckUtils]: 16: Hoare triple {321#false} ~j~0 := ~i~0 - 1; {321#false} is VALID [2020-07-10 15:28:04,676 INFO L280 TraceCheckUtils]: 17: Hoare triple {321#false} #t~short14 := 0 < ~j~0; {321#false} is VALID [2020-07-10 15:28:04,676 INFO L280 TraceCheckUtils]: 18: Hoare triple {321#false} assume !#t~short14; {321#false} is VALID [2020-07-10 15:28:04,676 INFO L280 TraceCheckUtils]: 19: Hoare triple {321#false} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {321#false} is VALID [2020-07-10 15:28:04,677 INFO L280 TraceCheckUtils]: 20: Hoare triple {321#false} #t~short17 := 0 < ~j~0; {321#false} is VALID [2020-07-10 15:28:04,677 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-10 15:28:04,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {321#false} assume #t~short17;havoc #t~mem16;havoc #t~short17;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {321#false} is VALID [2020-07-10 15:28:04,678 INFO L280 TraceCheckUtils]: 23: Hoare triple {321#false} assume ~start~0 <= ~j~0; {321#false} is VALID [2020-07-10 15:28:04,678 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-10 15:28:04,678 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-10 15:28:04,678 INFO L280 TraceCheckUtils]: 26: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:28:04,679 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {320#true} {321#false} #129#return; {321#false} is VALID [2020-07-10 15:28:04,679 INFO L280 TraceCheckUtils]: 28: Hoare triple {321#false} havoc #t~ret19.base, #t~ret19.offset; {321#false} is VALID [2020-07-10 15:28:04,681 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-10 15:28:04,682 INFO L280 TraceCheckUtils]: 30: Hoare triple {321#false} ~cond := #in~cond; {321#false} is VALID [2020-07-10 15:28:04,682 INFO L280 TraceCheckUtils]: 31: Hoare triple {321#false} assume 0 == ~cond; {321#false} is VALID [2020-07-10 15:28:04,682 INFO L280 TraceCheckUtils]: 32: Hoare triple {321#false} assume !false; {321#false} is VALID [2020-07-10 15:28:04,687 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-10 15:28:04,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782937901] [2020-07-10 15:28:04,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:04,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:04,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908360115] [2020-07-10 15:28:04,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-10 15:28:04,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:04,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:04,732 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-10 15:28:04,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:04,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:04,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:04,734 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2020-07-10 15:28:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:05,006 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-10 15:28:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:28:05,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-10 15:28:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2020-07-10 15:28:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2020-07-10 15:28:05,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2020-07-10 15:28:05,164 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-10 15:28:05,166 INFO L225 Difference]: With dead ends: 78 [2020-07-10 15:28:05,167 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:28:05,168 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-10 15:28:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:28:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 15:28:05,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:05,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 15:28:05,200 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 15:28:05,201 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 15:28:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:05,204 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:28:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:28:05,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:05,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:05,205 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 15:28:05,205 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 15:28:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:05,208 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:28:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:28:05,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:05,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:05,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:05,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:28:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 15:28:05,215 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2020-07-10 15:28:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:05,215 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 15:28:05,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:28:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:28:05,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:05,217 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-10 15:28:05,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:05,223 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:05,223 INFO L82 PathProgramCache]: Analyzing trace with hash 250921700, now seen corresponding path program 1 times [2020-07-10 15:28:05,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:05,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097707822] [2020-07-10 15:28:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,459 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-10 15:28:05,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 15:28:05,460 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {575#true} {575#true} #133#return; {575#true} is VALID [2020-07-10 15:28:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:05,470 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-10 15:28:05,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 15:28:05,471 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {575#true} {576#false} #129#return; {576#false} is VALID [2020-07-10 15:28:05,472 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-10 15:28:05,473 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-10 15:28:05,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 15:28:05,473 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #133#return; {575#true} is VALID [2020-07-10 15:28:05,474 INFO L263 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret21 := main(); {575#true} is VALID [2020-07-10 15:28:05,474 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-10 15:28:05,474 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-10 15:28:05,476 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-10 15:28:05,477 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-10 15:28:05,478 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-10 15:28:05,479 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-10 15:28:05,479 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-10 15:28:05,480 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-10 15:28:05,481 INFO L280 TraceCheckUtils]: 13: Hoare triple {580#(= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {580#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:05,484 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-10 15:28:05,485 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-10 15:28:05,486 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-10 15:28:05,487 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-10 15:28:05,488 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-10 15:28:05,489 INFO L280 TraceCheckUtils]: 19: Hoare triple {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:05,490 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-10 15:28:05,491 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-10 15:28:05,492 INFO L280 TraceCheckUtils]: 22: Hoare triple {583#(<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0)} assume #t~short17;havoc #t~mem16;havoc #t~short17;#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-10 15:28:05,493 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-10 15:28:05,493 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-10 15:28:05,494 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-10 15:28:05,494 INFO L280 TraceCheckUtils]: 26: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 15:28:05,496 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {575#true} {576#false} #129#return; {576#false} is VALID [2020-07-10 15:28:05,497 INFO L280 TraceCheckUtils]: 28: Hoare triple {576#false} havoc #t~ret19.base, #t~ret19.offset; {576#false} is VALID [2020-07-10 15:28:05,497 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-10 15:28:05,497 INFO L280 TraceCheckUtils]: 30: Hoare triple {576#false} ~cond := #in~cond; {576#false} is VALID [2020-07-10 15:28:05,498 INFO L280 TraceCheckUtils]: 31: Hoare triple {576#false} assume 0 == ~cond; {576#false} is VALID [2020-07-10 15:28:05,498 INFO L280 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID [2020-07-10 15:28:05,503 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-10 15:28:05,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097707822] [2020-07-10 15:28:05,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:05,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:28:05,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756455313] [2020-07-10 15:28:05,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-10 15:28:05,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:05,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:05,552 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-10 15:28:05,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:05,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:05,553 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 8 states. [2020-07-10 15:28:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:06,547 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2020-07-10 15:28:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:28:06,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-10 15:28:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2020-07-10 15:28:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2020-07-10 15:28:06,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 183 transitions. [2020-07-10 15:28:06,775 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-10 15:28:06,780 INFO L225 Difference]: With dead ends: 140 [2020-07-10 15:28:06,780 INFO L226 Difference]: Without dead ends: 91 [2020-07-10 15:28:06,781 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-10 15:28:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-10 15:28:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2020-07-10 15:28:06,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:06,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 66 states. [2020-07-10 15:28:06,806 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 66 states. [2020-07-10 15:28:06,806 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 66 states. [2020-07-10 15:28:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:06,813 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2020-07-10 15:28:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2020-07-10 15:28:06,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:06,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:06,815 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 91 states. [2020-07-10 15:28:06,815 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 91 states. [2020-07-10 15:28:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:06,821 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2020-07-10 15:28:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2020-07-10 15:28:06,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:06,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:06,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:06,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 15:28:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2020-07-10 15:28:06,826 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 33 [2020-07-10 15:28:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:06,827 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2020-07-10 15:28:06,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2020-07-10 15:28:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:28:06,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:06,828 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-10 15:28:06,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:28:06,829 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1743223006, now seen corresponding path program 1 times [2020-07-10 15:28:06,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:06,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947309082] [2020-07-10 15:28:06,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:06,995 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-10 15:28:06,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-10 15:28:06,999 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1036#true} {1036#true} #133#return; {1036#true} is VALID [2020-07-10 15:28:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,012 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-10 15:28:07,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-10 15:28:07,013 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1036#true} {1037#false} #129#return; {1037#false} is VALID [2020-07-10 15:28:07,016 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-10 15:28:07,016 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-10 15:28:07,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-10 15:28:07,017 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #133#return; {1036#true} is VALID [2020-07-10 15:28:07,017 INFO L263 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret21 := main(); {1036#true} is VALID [2020-07-10 15:28:07,018 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-10 15:28:07,018 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-10 15:28:07,019 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-10 15:28:07,020 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-10 15:28:07,020 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-10 15:28:07,021 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-10 15:28:07,022 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-10 15:28:07,022 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-10 15:28:07,023 INFO L280 TraceCheckUtils]: 13: Hoare triple {1041#(= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {1041#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:07,023 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-10 15:28:07,024 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-10 15:28:07,025 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-10 15:28:07,026 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-10 15:28:07,027 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-10 15:28:07,027 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~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {1043#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:07,028 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-10 15:28:07,029 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-10 15:28:07,030 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~mem16;havoc #t~short17;#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-10 15:28:07,031 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-10 15:28:07,031 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-10 15:28:07,032 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-10 15:28:07,032 INFO L280 TraceCheckUtils]: 26: Hoare triple {1036#true} assume true; {1036#true} is VALID [2020-07-10 15:28:07,032 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1036#true} {1037#false} #129#return; {1037#false} is VALID [2020-07-10 15:28:07,032 INFO L280 TraceCheckUtils]: 28: Hoare triple {1037#false} havoc #t~ret19.base, #t~ret19.offset; {1037#false} is VALID [2020-07-10 15:28:07,033 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-10 15:28:07,033 INFO L280 TraceCheckUtils]: 30: Hoare triple {1037#false} ~cond := #in~cond; {1037#false} is VALID [2020-07-10 15:28:07,033 INFO L280 TraceCheckUtils]: 31: Hoare triple {1037#false} assume 0 == ~cond; {1037#false} is VALID [2020-07-10 15:28:07,033 INFO L280 TraceCheckUtils]: 32: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2020-07-10 15:28:07,036 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-10 15:28:07,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947309082] [2020-07-10 15:28:07,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:07,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:07,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301989329] [2020-07-10 15:28:07,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-10 15:28:07,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:07,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:07,079 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-10 15:28:07,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:07,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:07,081 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 7 states. [2020-07-10 15:28:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:07,596 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2020-07-10 15:28:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:07,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-10 15:28:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2020-07-10 15:28:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2020-07-10 15:28:07,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 160 transitions. [2020-07-10 15:28:07,800 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-10 15:28:07,805 INFO L225 Difference]: With dead ends: 136 [2020-07-10 15:28:07,805 INFO L226 Difference]: Without dead ends: 92 [2020-07-10 15:28:07,806 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-10 15:28:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-10 15:28:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2020-07-10 15:28:07,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:07,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 76 states. [2020-07-10 15:28:07,844 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 76 states. [2020-07-10 15:28:07,844 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 76 states. [2020-07-10 15:28:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:07,852 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-10 15:28:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-10 15:28:07,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:07,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:07,855 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 92 states. [2020-07-10 15:28:07,856 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 92 states. [2020-07-10 15:28:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:07,861 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-10 15:28:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-10 15:28:07,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:07,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:07,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:07,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 15:28:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2020-07-10 15:28:07,866 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 33 [2020-07-10 15:28:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:07,867 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-07-10 15:28:07,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2020-07-10 15:28:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:28:07,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:07,870 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-10 15:28:07,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:28:07,870 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1042158428, now seen corresponding path program 1 times [2020-07-10 15:28:07,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:07,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899982319] [2020-07-10 15:28:07,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,968 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-10 15:28:07,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-10 15:28:07,968 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1495#true} #133#return; {1495#true} is VALID [2020-07-10 15:28:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:07,973 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-10 15:28:07,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-10 15:28:07,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1496#false} #129#return; {1496#false} is VALID [2020-07-10 15:28:07,975 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-10 15:28:07,975 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-10 15:28:07,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-10 15:28:07,976 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #133#return; {1495#true} is VALID [2020-07-10 15:28:07,976 INFO L263 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret21 := main(); {1495#true} is VALID [2020-07-10 15:28:07,976 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-10 15:28:07,977 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-10 15:28:07,978 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-10 15:28:07,979 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-10 15:28:07,980 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-10 15:28:07,980 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-10 15:28:07,981 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-10 15:28:07,982 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-10 15:28:07,983 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~short7;havoc #t~mem5;havoc #t~mem6; {1501#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-10 15:28:07,984 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-10 15:28:07,984 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-10 15:28:07,985 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-10 15:28:07,986 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-10 15:28:07,987 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-10 15:28:07,987 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~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,988 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-10 15:28:07,989 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-10 15:28:07,990 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~mem16;havoc #t~short17; {1502#(and (= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-10 15:28:07,991 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-10 15:28:07,991 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-10 15:28:07,991 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-10 15:28:07,992 INFO L280 TraceCheckUtils]: 26: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-10 15:28:07,992 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1495#true} {1496#false} #129#return; {1496#false} is VALID [2020-07-10 15:28:07,992 INFO L280 TraceCheckUtils]: 28: Hoare triple {1496#false} havoc #t~ret19.base, #t~ret19.offset; {1496#false} is VALID [2020-07-10 15:28:07,992 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-10 15:28:07,993 INFO L280 TraceCheckUtils]: 30: Hoare triple {1496#false} ~cond := #in~cond; {1496#false} is VALID [2020-07-10 15:28:07,993 INFO L280 TraceCheckUtils]: 31: Hoare triple {1496#false} assume 0 == ~cond; {1496#false} is VALID [2020-07-10 15:28:07,993 INFO L280 TraceCheckUtils]: 32: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2020-07-10 15:28:07,995 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-10 15:28:07,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899982319] [2020-07-10 15:28:07,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:07,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:07,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050791185] [2020-07-10 15:28:07,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-10 15:28:07,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:07,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:08,035 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-10 15:28:08,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:08,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:08,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:08,036 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 6 states. [2020-07-10 15:28:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:08,592 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2020-07-10 15:28:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:08,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-10 15:28:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2020-07-10 15:28:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2020-07-10 15:28:08,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2020-07-10 15:28:08,772 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-10 15:28:08,775 INFO L225 Difference]: With dead ends: 138 [2020-07-10 15:28:08,775 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:28:08,776 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-10 15:28:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:28:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-07-10 15:28:08,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:08,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 83 states. [2020-07-10 15:28:08,808 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 83 states. [2020-07-10 15:28:08,808 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 83 states. [2020-07-10 15:28:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:08,812 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-10 15:28:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-10 15:28:08,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:08,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:08,813 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 89 states. [2020-07-10 15:28:08,813 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 89 states. [2020-07-10 15:28:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:08,817 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-10 15:28:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-10 15:28:08,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:08,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:08,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:08,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-10 15:28:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2020-07-10 15:28:08,821 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 33 [2020-07-10 15:28:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:08,821 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2020-07-10 15:28:08,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2020-07-10 15:28:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 15:28:08,822 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:08,822 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-10 15:28:08,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:28:08,823 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash -151257089, now seen corresponding path program 1 times [2020-07-10 15:28:08,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:08,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143023055] [2020-07-10 15:28:08,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,876 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-10 15:28:08,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-10 15:28:08,877 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1961#true} #133#return; {1961#true} is VALID [2020-07-10 15:28:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,884 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-10 15:28:08,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-10 15:28:08,885 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1962#false} #129#return; {1962#false} is VALID [2020-07-10 15:28:08,885 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-10 15:28:08,886 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-10 15:28:08,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-10 15:28:08,886 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #133#return; {1961#true} is VALID [2020-07-10 15:28:08,886 INFO L263 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret21 := main(); {1961#true} is VALID [2020-07-10 15:28:08,887 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-10 15:28:08,887 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-10 15:28:08,888 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-10 15:28:08,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {1961#true} assume !(~str.base == 0 && ~str.offset == 0); {1961#true} is VALID [2020-07-10 15:28:08,888 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-10 15:28:08,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {1961#true} assume #t~switch4; {1961#true} is VALID [2020-07-10 15:28:08,889 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-10 15:28:08,889 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-10 15:28:08,890 INFO L280 TraceCheckUtils]: 13: Hoare triple {1961#true} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {1961#true} is VALID [2020-07-10 15:28:08,890 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-10 15:28:08,890 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-10 15:28:08,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {1961#true} ~j~0 := ~i~0 - 1; {1961#true} is VALID [2020-07-10 15:28:08,891 INFO L280 TraceCheckUtils]: 17: Hoare triple {1961#true} #t~short14 := 0 < ~j~0; {1961#true} is VALID [2020-07-10 15:28:08,891 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-10 15:28:08,893 INFO L280 TraceCheckUtils]: 19: Hoare triple {1961#true} assume #t~short13; {1966#|parse_expression_list_#t~short13|} is VALID [2020-07-10 15:28:08,895 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-10 15:28:08,897 INFO L280 TraceCheckUtils]: 21: Hoare triple {1967#|parse_expression_list_#t~short14|} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {1962#false} is VALID [2020-07-10 15:28:08,898 INFO L280 TraceCheckUtils]: 22: Hoare triple {1962#false} #t~short17 := 0 < ~j~0; {1962#false} is VALID [2020-07-10 15:28:08,898 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-10 15:28:08,898 INFO L280 TraceCheckUtils]: 24: Hoare triple {1962#false} assume #t~short17;havoc #t~mem16;havoc #t~short17;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {1962#false} is VALID [2020-07-10 15:28:08,898 INFO L280 TraceCheckUtils]: 25: Hoare triple {1962#false} assume ~start~0 <= ~j~0; {1962#false} is VALID [2020-07-10 15:28:08,898 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-10 15:28:08,898 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-10 15:28:08,899 INFO L280 TraceCheckUtils]: 28: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-10 15:28:08,899 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1961#true} {1962#false} #129#return; {1962#false} is VALID [2020-07-10 15:28:08,899 INFO L280 TraceCheckUtils]: 30: Hoare triple {1962#false} havoc #t~ret19.base, #t~ret19.offset; {1962#false} is VALID [2020-07-10 15:28:08,899 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-10 15:28:08,899 INFO L280 TraceCheckUtils]: 32: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2020-07-10 15:28:08,900 INFO L280 TraceCheckUtils]: 33: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2020-07-10 15:28:08,900 INFO L280 TraceCheckUtils]: 34: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2020-07-10 15:28:08,901 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-10 15:28:08,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143023055] [2020-07-10 15:28:08,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:08,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:08,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142383439] [2020-07-10 15:28:08,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-10 15:28:08,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:08,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:08,939 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-10 15:28:08,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:08,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:08,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:08,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:08,941 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand 5 states. [2020-07-10 15:28:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,214 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2020-07-10 15:28:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:09,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-10 15:28:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2020-07-10 15:28:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2020-07-10 15:28:09,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2020-07-10 15:28:09,323 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-10 15:28:09,325 INFO L225 Difference]: With dead ends: 124 [2020-07-10 15:28:09,326 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:28:09,326 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-10 15:28:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:28:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-07-10 15:28:09,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:09,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2020-07-10 15:28:09,363 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2020-07-10 15:28:09,363 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2020-07-10 15:28:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,367 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-10 15:28:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-10 15:28:09,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,368 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2020-07-10 15:28:09,368 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2020-07-10 15:28:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,371 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2020-07-10 15:28:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-10 15:28:09,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:09,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-10 15:28:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2020-07-10 15:28:09,385 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 35 [2020-07-10 15:28:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:09,385 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2020-07-10 15:28:09,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-10 15:28:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 15:28:09,387 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:09,387 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-10 15:28:09,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:28:09,388 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1172325443, now seen corresponding path program 1 times [2020-07-10 15:28:09,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:09,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030331301] [2020-07-10 15:28:09,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,505 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-10 15:28:09,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:09,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #133#return; {2414#true} is VALID [2020-07-10 15:28:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,509 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-10 15:28:09,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:09,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2415#false} #129#return; {2415#false} is VALID [2020-07-10 15:28:09,511 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-10 15:28:09,511 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-10 15:28:09,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:09,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #133#return; {2414#true} is VALID [2020-07-10 15:28:09,512 INFO L263 TraceCheckUtils]: 4: Hoare triple {2414#true} call #t~ret21 := main(); {2414#true} is VALID [2020-07-10 15:28:09,512 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-10 15:28:09,513 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-10 15:28:09,513 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-10 15:28:09,514 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-10 15:28:09,515 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-10 15:28:09,516 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-10 15:28:09,516 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-10 15:28:09,517 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-10 15:28:09,517 INFO L280 TraceCheckUtils]: 13: Hoare triple {2420#(<= parse_expression_list_~i~0 0)} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {2420#(<= parse_expression_list_~i~0 0)} is VALID [2020-07-10 15:28:09,518 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-10 15:28:09,519 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-10 15:28:09,521 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-10 15:28:09,523 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-10 15:28:09,525 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-10 15:28:09,525 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-10 15:28:09,525 INFO L280 TraceCheckUtils]: 20: Hoare triple {2415#false} #t~short14 := #t~short13; {2415#false} is VALID [2020-07-10 15:28:09,526 INFO L280 TraceCheckUtils]: 21: Hoare triple {2415#false} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {2415#false} is VALID [2020-07-10 15:28:09,526 INFO L280 TraceCheckUtils]: 22: Hoare triple {2415#false} #t~short17 := 0 < ~j~0; {2415#false} is VALID [2020-07-10 15:28:09,526 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-10 15:28:09,526 INFO L280 TraceCheckUtils]: 24: Hoare triple {2415#false} assume #t~short17;havoc #t~mem16;havoc #t~short17;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {2415#false} is VALID [2020-07-10 15:28:09,526 INFO L280 TraceCheckUtils]: 25: Hoare triple {2415#false} assume ~start~0 <= ~j~0; {2415#false} is VALID [2020-07-10 15:28:09,527 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-10 15:28:09,527 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-10 15:28:09,527 INFO L280 TraceCheckUtils]: 28: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-10 15:28:09,527 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2414#true} {2415#false} #129#return; {2415#false} is VALID [2020-07-10 15:28:09,528 INFO L280 TraceCheckUtils]: 30: Hoare triple {2415#false} havoc #t~ret19.base, #t~ret19.offset; {2415#false} is VALID [2020-07-10 15:28:09,528 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-10 15:28:09,528 INFO L280 TraceCheckUtils]: 32: Hoare triple {2415#false} ~cond := #in~cond; {2415#false} is VALID [2020-07-10 15:28:09,528 INFO L280 TraceCheckUtils]: 33: Hoare triple {2415#false} assume 0 == ~cond; {2415#false} is VALID [2020-07-10 15:28:09,528 INFO L280 TraceCheckUtils]: 34: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2020-07-10 15:28:09,530 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-10 15:28:09,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030331301] [2020-07-10 15:28:09,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:09,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237838303] [2020-07-10 15:28:09,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 15:28:09,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:09,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:09,569 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-10 15:28:09,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:09,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:09,570 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 7 states. [2020-07-10 15:28:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,065 INFO L93 Difference]: Finished difference Result 147 states and 187 transitions. [2020-07-10 15:28:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:10,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 15:28:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2020-07-10 15:28:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2020-07-10 15:28:10,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 130 transitions. [2020-07-10 15:28:10,219 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-10 15:28:10,222 INFO L225 Difference]: With dead ends: 147 [2020-07-10 15:28:10,222 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:28:10,226 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-10 15:28:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:28:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2020-07-10 15:28:10,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:10,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2020-07-10 15:28:10,260 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2020-07-10 15:28:10,260 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2020-07-10 15:28:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,264 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2020-07-10 15:28:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2020-07-10 15:28:10,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:10,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:10,265 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2020-07-10 15:28:10,265 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2020-07-10 15:28:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,268 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2020-07-10 15:28:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2020-07-10 15:28:10,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:10,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:10,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:10,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 15:28:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2020-07-10 15:28:10,272 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 35 [2020-07-10 15:28:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:10,273 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2020-07-10 15:28:10,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2020-07-10 15:28:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:28:10,274 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:10,274 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-10 15:28:10,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:28:10,274 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1310821647, now seen corresponding path program 1 times [2020-07-10 15:28:10,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:10,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353298742] [2020-07-10 15:28:10,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,398 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-10 15:28:10,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-10 15:28:10,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2895#true} {2895#true} #133#return; {2895#true} is VALID [2020-07-10 15:28:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,407 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-10 15:28:10,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-10 15:28:10,409 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-10 15:28:10,410 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-10 15:28:10,411 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-10 15:28:10,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-10 15:28:10,411 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2895#true} {2895#true} #133#return; {2895#true} is VALID [2020-07-10 15:28:10,411 INFO L263 TraceCheckUtils]: 4: Hoare triple {2895#true} call #t~ret21 := main(); {2895#true} is VALID [2020-07-10 15:28:10,412 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-10 15:28:10,412 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-10 15:28:10,413 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-10 15:28:10,413 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-10 15:28:10,414 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-10 15:28:10,414 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-10 15:28:10,415 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-10 15:28:10,416 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-10 15:28:10,417 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-10 15:28:10,418 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-10 15:28:10,424 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-10 15:28:10,427 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-10 15:28:10,428 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-10 15:28:10,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {2900#(= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {2900#(= 0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:10,431 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-10 15:28:10,431 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-10 15:28:10,432 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-10 15:28:10,432 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-10 15:28:10,433 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-10 15:28:10,434 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~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,434 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-10 15:28:10,435 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-10 15:28:10,437 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~mem16;havoc #t~short17; {2902#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-10 15:28:10,437 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-10 15:28:10,438 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-10 15:28:10,438 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-10 15:28:10,438 INFO L280 TraceCheckUtils]: 31: Hoare triple {2895#true} assume true; {2895#true} is VALID [2020-07-10 15:28:10,439 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-10 15:28:10,440 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-10 15:28:10,441 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-10 15:28:10,442 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-10 15:28:10,442 INFO L280 TraceCheckUtils]: 36: Hoare triple {2907#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2896#false} is VALID [2020-07-10 15:28:10,442 INFO L280 TraceCheckUtils]: 37: Hoare triple {2896#false} assume !false; {2896#false} is VALID [2020-07-10 15:28:10,445 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-10 15:28:10,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353298742] [2020-07-10 15:28:10,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:10,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:28:10,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757737193] [2020-07-10 15:28:10,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-10 15:28:10,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:10,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:10,507 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-10 15:28:10,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:10,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:10,508 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 8 states. [2020-07-10 15:28:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,220 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2020-07-10 15:28:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:28:11,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-10 15:28:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2020-07-10 15:28:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2020-07-10 15:28:11,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2020-07-10 15:28:11,345 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-10 15:28:11,347 INFO L225 Difference]: With dead ends: 107 [2020-07-10 15:28:11,348 INFO L226 Difference]: Without dead ends: 105 [2020-07-10 15:28:11,349 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-10 15:28:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-10 15:28:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-07-10 15:28:11,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:11,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 93 states. [2020-07-10 15:28:11,395 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 93 states. [2020-07-10 15:28:11,395 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 93 states. [2020-07-10 15:28:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,403 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2020-07-10 15:28:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2020-07-10 15:28:11,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,404 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 105 states. [2020-07-10 15:28:11,404 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 105 states. [2020-07-10 15:28:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:11,410 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2020-07-10 15:28:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2020-07-10 15:28:11,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:11,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:11,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:11,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-10 15:28:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-07-10 15:28:11,421 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 38 [2020-07-10 15:28:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:11,421 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-07-10 15:28:11,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-10 15:28:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:28:11,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:11,423 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-10 15:28:11,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:28:11,423 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 888728936, now seen corresponding path program 1 times [2020-07-10 15:28:11,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:11,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786247788] [2020-07-10 15:28:11,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,564 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-10 15:28:11,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:28:11,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3375#true} {3375#true} #133#return; {3375#true} is VALID [2020-07-10 15:28:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,572 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-10 15:28:11,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:28:11,573 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3375#true} {3376#false} #129#return; {3376#false} is VALID [2020-07-10 15:28:11,574 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-10 15:28:11,574 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-10 15:28:11,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:28:11,574 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #133#return; {3375#true} is VALID [2020-07-10 15:28:11,575 INFO L263 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret21 := main(); {3375#true} is VALID [2020-07-10 15:28:11,575 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-10 15:28:11,575 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-10 15:28:11,576 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-10 15:28:11,576 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-10 15:28:11,577 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-10 15:28:11,578 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-10 15:28:11,581 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-10 15:28:11,581 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-10 15:28:11,582 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-10 15:28:11,583 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-10 15:28:11,584 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-10 15:28:11,584 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-10 15:28:11,585 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-10 15:28:11,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-10 15:28:11,586 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-10 15:28:11,586 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-10 15:28:11,588 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-10 15:28:11,589 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-10 15:28:11,589 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-10 15:28:11,589 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-10 15:28:11,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#false} #t~short14 := #t~short13; {3376#false} is VALID [2020-07-10 15:28:11,590 INFO L280 TraceCheckUtils]: 26: Hoare triple {3376#false} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {3376#false} is VALID [2020-07-10 15:28:11,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {3376#false} #t~short17 := 0 < ~j~0; {3376#false} is VALID [2020-07-10 15:28:11,590 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-10 15:28:11,590 INFO L280 TraceCheckUtils]: 29: Hoare triple {3376#false} assume #t~short17;havoc #t~mem16;havoc #t~short17;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {3376#false} is VALID [2020-07-10 15:28:11,591 INFO L280 TraceCheckUtils]: 30: Hoare triple {3376#false} assume ~start~0 <= ~j~0; {3376#false} is VALID [2020-07-10 15:28:11,591 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-10 15:28:11,591 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-10 15:28:11,591 INFO L280 TraceCheckUtils]: 33: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:28:11,591 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3375#true} {3376#false} #129#return; {3376#false} is VALID [2020-07-10 15:28:11,592 INFO L280 TraceCheckUtils]: 35: Hoare triple {3376#false} havoc #t~ret19.base, #t~ret19.offset; {3376#false} is VALID [2020-07-10 15:28:11,592 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-10 15:28:11,592 INFO L280 TraceCheckUtils]: 37: Hoare triple {3376#false} ~cond := #in~cond; {3376#false} is VALID [2020-07-10 15:28:11,592 INFO L280 TraceCheckUtils]: 38: Hoare triple {3376#false} assume 0 == ~cond; {3376#false} is VALID [2020-07-10 15:28:11,592 INFO L280 TraceCheckUtils]: 39: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2020-07-10 15:28:11,594 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-10 15:28:11,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786247788] [2020-07-10 15:28:11,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618674722] [2020-07-10 15:28:11,598 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-10 15:28:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:28:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:11,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:11,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:11,860 INFO L263 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2020-07-10 15:28:11,860 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-10 15:28:11,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:28:11,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #133#return; {3375#true} is VALID [2020-07-10 15:28:11,861 INFO L263 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret21 := main(); {3375#true} is VALID [2020-07-10 15:28:11,861 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-10 15:28:11,861 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-10 15:28:11,862 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-10 15:28:11,863 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-10 15:28:11,864 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-10 15:28:11,865 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-10 15:28:11,865 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-10 15:28:11,866 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-10 15:28:11,867 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-10 15:28:11,868 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-10 15:28:11,868 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-10 15:28:11,869 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-10 15:28:11,869 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-10 15:28:11,870 INFO L280 TraceCheckUtils]: 18: Hoare triple {3382#(<= parse_expression_list_~i~0 1)} assume !#t~short7;havoc #t~short7;havoc #t~mem5;havoc #t~mem6; {3382#(<= parse_expression_list_~i~0 1)} is VALID [2020-07-10 15:28:11,871 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-10 15:28:11,871 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-10 15:28:11,872 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-10 15:28:11,873 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-10 15:28:11,873 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-10 15:28:11,874 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-10 15:28:11,874 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#false} #t~short14 := #t~short13; {3376#false} is VALID [2020-07-10 15:28:11,874 INFO L280 TraceCheckUtils]: 26: Hoare triple {3376#false} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {3376#false} is VALID [2020-07-10 15:28:11,874 INFO L280 TraceCheckUtils]: 27: Hoare triple {3376#false} #t~short17 := 0 < ~j~0; {3376#false} is VALID [2020-07-10 15:28:11,875 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-10 15:28:11,875 INFO L280 TraceCheckUtils]: 29: Hoare triple {3376#false} assume #t~short17;havoc #t~mem16;havoc #t~short17;#t~post18 := ~j~0;~j~0 := #t~post18 - 1;havoc #t~post18; {3376#false} is VALID [2020-07-10 15:28:11,875 INFO L280 TraceCheckUtils]: 30: Hoare triple {3376#false} assume ~start~0 <= ~j~0; {3376#false} is VALID [2020-07-10 15:28:11,876 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-10 15:28:11,876 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-10 15:28:11,876 INFO L280 TraceCheckUtils]: 33: Hoare triple {3376#false} assume true; {3376#false} is VALID [2020-07-10 15:28:11,877 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3376#false} {3376#false} #129#return; {3376#false} is VALID [2020-07-10 15:28:11,877 INFO L280 TraceCheckUtils]: 35: Hoare triple {3376#false} havoc #t~ret19.base, #t~ret19.offset; {3376#false} is VALID [2020-07-10 15:28:11,877 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-10 15:28:11,877 INFO L280 TraceCheckUtils]: 37: Hoare triple {3376#false} ~cond := #in~cond; {3376#false} is VALID [2020-07-10 15:28:11,878 INFO L280 TraceCheckUtils]: 38: Hoare triple {3376#false} assume 0 == ~cond; {3376#false} is VALID [2020-07-10 15:28:11,878 INFO L280 TraceCheckUtils]: 39: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2020-07-10 15:28:11,880 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-10 15:28:11,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:11,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2020-07-10 15:28:11,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249440459] [2020-07-10 15:28:11,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-10 15:28:11,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:11,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:11,940 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-10 15:28:11,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:11,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:11,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:11,941 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 8 states. [2020-07-10 15:28:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,552 INFO L93 Difference]: Finished difference Result 209 states and 263 transitions. [2020-07-10 15:28:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:12,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-10 15:28:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2020-07-10 15:28:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2020-07-10 15:28:12,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 148 transitions. [2020-07-10 15:28:12,709 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-10 15:28:12,712 INFO L225 Difference]: With dead ends: 209 [2020-07-10 15:28:12,712 INFO L226 Difference]: Without dead ends: 136 [2020-07-10 15:28:12,718 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-10 15:28:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-10 15:28:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 106. [2020-07-10 15:28:12,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:12,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 106 states. [2020-07-10 15:28:12,771 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 106 states. [2020-07-10 15:28:12,771 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 106 states. [2020-07-10 15:28:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,784 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-10 15:28:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-10 15:28:12,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:12,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:12,785 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 136 states. [2020-07-10 15:28:12,786 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 136 states. [2020-07-10 15:28:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:12,795 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-10 15:28:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-10 15:28:12,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:12,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:12,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:12,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-10 15:28:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2020-07-10 15:28:12,804 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 40 [2020-07-10 15:28:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:12,805 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2020-07-10 15:28:12,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2020-07-10 15:28:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:28:12,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:12,807 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-10 15:28:13,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-10 15:28:13,020 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1526927005, now seen corresponding path program 2 times [2020-07-10 15:28:13,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:13,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578896089] [2020-07-10 15:28:13,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,197 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-10 15:28:13,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-10 15:28:13,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4173#true} {4173#true} #133#return; {4173#true} is VALID [2020-07-10 15:28:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,211 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-10 15:28:13,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-10 15:28:13,213 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-10 15:28:13,214 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-10 15:28:13,214 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-10 15:28:13,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-10 15:28:13,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4173#true} {4173#true} #133#return; {4173#true} is VALID [2020-07-10 15:28:13,214 INFO L263 TraceCheckUtils]: 4: Hoare triple {4173#true} call #t~ret21 := main(); {4173#true} is VALID [2020-07-10 15:28:13,214 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-10 15:28:13,215 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-10 15:28:13,216 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-10 15:28:13,217 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-10 15:28:13,218 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-10 15:28:13,218 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-10 15:28:13,219 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-10 15:28:13,220 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-10 15:28:13,231 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-10 15:28:13,235 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-10 15:28:13,235 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-10 15:28:13,236 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-10 15:28:13,236 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-10 15:28:13,237 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-10 15:28:13,238 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-10 15:28:13,238 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-10 15:28:13,239 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-10 15:28:13,239 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-10 15:28:13,240 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~short7;havoc #t~mem5;havoc #t~mem6; {4181#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-10 15:28:13,241 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-10 15:28:13,241 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-10 15:28:13,242 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-10 15:28:13,243 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-10 15:28:13,243 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-10 15:28:13,244 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-10 15:28:13,244 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-10 15:28:13,250 INFO L280 TraceCheckUtils]: 31: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume !#t~short14;havoc #t~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} is VALID [2020-07-10 15:28:13,250 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-10 15:28:13,250 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-10 15:28:13,251 INFO L280 TraceCheckUtils]: 34: Hoare triple {4183#(<= parse_expression_list_~j~0 parse_expression_list_~start~0)} assume #t~short17;havoc #t~mem16;havoc #t~short17;#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-10 15:28:13,252 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-10 15:28:13,252 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-10 15:28:13,252 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-10 15:28:13,252 INFO L280 TraceCheckUtils]: 38: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-10 15:28:13,254 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-10 15:28:13,254 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-10 15:28:13,255 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-10 15:28:13,256 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-10 15:28:13,256 INFO L280 TraceCheckUtils]: 43: Hoare triple {4189#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4174#false} is VALID [2020-07-10 15:28:13,257 INFO L280 TraceCheckUtils]: 44: Hoare triple {4174#false} assume !false; {4174#false} is VALID [2020-07-10 15:28:13,260 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-10 15:28:13,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578896089] [2020-07-10 15:28:13,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978174398] [2020-07-10 15:28:13,260 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-10 15:28:13,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:28:13,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:13,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:28:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:13,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:13,614 INFO L263 TraceCheckUtils]: 0: Hoare triple {4173#true} call ULTIMATE.init(); {4173#true} is VALID [2020-07-10 15:28:13,615 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-10 15:28:13,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {4173#true} assume true; {4173#true} is VALID [2020-07-10 15:28:13,615 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4173#true} {4173#true} #133#return; {4173#true} is VALID [2020-07-10 15:28:13,616 INFO L263 TraceCheckUtils]: 4: Hoare triple {4173#true} call #t~ret21 := main(); {4173#true} is VALID [2020-07-10 15:28:13,616 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-10 15:28:13,616 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-10 15:28:13,617 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-10 15:28:13,617 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-10 15:28:13,618 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-10 15:28:13,619 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-10 15:28:13,619 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-10 15:28:13,620 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-10 15:28:13,620 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-10 15:28:13,621 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-10 15:28:13,622 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-10 15:28:13,622 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-10 15:28:13,623 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-10 15:28:13,623 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-10 15:28:13,624 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-10 15:28:13,624 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-10 15:28:13,625 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-10 15:28:13,626 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-10 15:28:13,627 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~short7;havoc #t~mem5;havoc #t~mem6; {4254#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-10 15:28:13,632 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-10 15:28:13,633 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-10 15:28:13,634 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-10 15:28:13,635 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-10 15:28:13,635 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-10 15:28:13,636 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-10 15:28:13,636 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-10 15:28:13,637 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~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {4277#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-10 15:28:13,637 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-10 15:28:13,638 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-10 15:28:13,639 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~mem16;havoc #t~short17;#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-10 15:28:13,639 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-10 15:28:13,639 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-10 15:28:13,639 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-10 15:28:13,640 INFO L280 TraceCheckUtils]: 38: Hoare triple {4174#false} assume true; {4174#false} is VALID [2020-07-10 15:28:13,640 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4174#false} {4174#false} #129#return; {4174#false} is VALID [2020-07-10 15:28:13,640 INFO L280 TraceCheckUtils]: 40: Hoare triple {4174#false} havoc #t~ret19.base, #t~ret19.offset; {4174#false} is VALID [2020-07-10 15:28:13,640 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-10 15:28:13,640 INFO L280 TraceCheckUtils]: 42: Hoare triple {4174#false} ~cond := #in~cond; {4174#false} is VALID [2020-07-10 15:28:13,640 INFO L280 TraceCheckUtils]: 43: Hoare triple {4174#false} assume 0 == ~cond; {4174#false} is VALID [2020-07-10 15:28:13,640 INFO L280 TraceCheckUtils]: 44: Hoare triple {4174#false} assume !false; {4174#false} is VALID [2020-07-10 15:28:13,643 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-10 15:28:13,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:13,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2020-07-10 15:28:13,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111744601] [2020-07-10 15:28:13,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-10 15:28:13,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:13,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:28:13,752 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-10 15:28:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:28:13,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:28:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:28:13,754 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand 19 states. [2020-07-10 15:28:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:16,171 INFO L93 Difference]: Finished difference Result 240 states and 302 transitions. [2020-07-10 15:28:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:28:16,172 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-10 15:28:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:28:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 229 transitions. [2020-07-10 15:28:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:28:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 229 transitions. [2020-07-10 15:28:16,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 229 transitions. [2020-07-10 15:28:16,496 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-10 15:28:16,501 INFO L225 Difference]: With dead ends: 240 [2020-07-10 15:28:16,502 INFO L226 Difference]: Without dead ends: 189 [2020-07-10 15:28:16,503 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-10 15:28:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-10 15:28:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 127. [2020-07-10 15:28:16,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:16,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 127 states. [2020-07-10 15:28:16,557 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 127 states. [2020-07-10 15:28:16,557 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 127 states. [2020-07-10 15:28:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:16,563 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2020-07-10 15:28:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2020-07-10 15:28:16,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:16,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:16,565 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 189 states. [2020-07-10 15:28:16,565 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 189 states. [2020-07-10 15:28:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:16,570 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2020-07-10 15:28:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2020-07-10 15:28:16,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:16,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:16,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:16,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-07-10 15:28:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2020-07-10 15:28:16,575 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 45 [2020-07-10 15:28:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:16,576 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2020-07-10 15:28:16,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:28:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2020-07-10 15:28:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:28:16,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:16,577 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-10 15:28:16,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-10 15:28:16,791 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 709278555, now seen corresponding path program 1 times [2020-07-10 15:28:16,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:16,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464419118] [2020-07-10 15:28:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:16,980 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-10 15:28:16,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-10 15:28:16,980 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5176#true} {5176#true} #133#return; {5176#true} is VALID [2020-07-10 15:28:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:16,989 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-10 15:28:16,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-10 15:28:16,991 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-10 15:28:16,991 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-10 15:28:16,992 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-10 15:28:16,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-10 15:28:16,992 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5176#true} {5176#true} #133#return; {5176#true} is VALID [2020-07-10 15:28:16,992 INFO L263 TraceCheckUtils]: 4: Hoare triple {5176#true} call #t~ret21 := main(); {5176#true} is VALID [2020-07-10 15:28:16,993 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-10 15:28:16,993 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-10 15:28:17,010 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-10 15:28:17,014 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-10 15:28:17,017 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-10 15:28:17,017 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-10 15:28:17,018 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-10 15:28:17,019 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-10 15:28:17,019 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-10 15:28:17,021 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-10 15:28:17,021 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-10 15:28:17,022 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-10 15:28:17,023 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-10 15:28:17,023 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-10 15:28:17,025 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-10 15:28:17,026 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-10 15:28:17,026 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-10 15:28:17,027 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-10 15:28:17,028 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~short7;havoc #t~mem5;havoc #t~mem6; {5184#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-10 15:28:17,028 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-10 15:28:17,029 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-10 15:28:17,030 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-10 15:28:17,030 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-10 15:28:17,031 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-10 15:28:17,032 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-10 15:28:17,033 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-10 15:28:17,034 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~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {5185#(and (= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-10 15:28:17,035 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-10 15:28:17,036 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-10 15:28:17,036 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~mem16;havoc #t~short17;#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-10 15:28:17,037 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-10 15:28:17,037 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-10 15:28:17,037 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-10 15:28:17,037 INFO L280 TraceCheckUtils]: 38: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-10 15:28:17,038 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-10 15:28:17,039 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-10 15:28:17,039 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-10 15:28:17,040 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-10 15:28:17,040 INFO L280 TraceCheckUtils]: 43: Hoare triple {5191#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5177#false} is VALID [2020-07-10 15:28:17,040 INFO L280 TraceCheckUtils]: 44: Hoare triple {5177#false} assume !false; {5177#false} is VALID [2020-07-10 15:28:17,044 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-10 15:28:17,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464419118] [2020-07-10 15:28:17,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093920344] [2020-07-10 15:28:17,044 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-10 15:28:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:17,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:28:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:17,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:17,356 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:17,363 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:17,415 INFO L263 TraceCheckUtils]: 0: Hoare triple {5176#true} call ULTIMATE.init(); {5176#true} is VALID [2020-07-10 15:28:17,415 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-10 15:28:17,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-10 15:28:17,416 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5176#true} {5176#true} #133#return; {5176#true} is VALID [2020-07-10 15:28:17,416 INFO L263 TraceCheckUtils]: 4: Hoare triple {5176#true} call #t~ret21 := main(); {5176#true} is VALID [2020-07-10 15:28:17,416 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-10 15:28:17,416 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-10 15:28:17,417 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-10 15:28:17,417 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-10 15:28:17,418 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-10 15:28:17,419 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-10 15:28:17,419 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-10 15:28:17,420 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-10 15:28:17,420 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-10 15:28:17,421 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-10 15:28:17,421 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-10 15:28:17,422 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-10 15:28:17,422 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-10 15:28:17,423 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-10 15:28:17,425 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-10 15:28:17,426 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-10 15:28:17,426 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-10 15:28:17,428 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-10 15:28:17,435 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~short7;havoc #t~mem5;havoc #t~mem6; {5256#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 2))} is VALID [2020-07-10 15:28:17,436 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-10 15:28:17,436 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-10 15:28:17,437 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-10 15:28:17,438 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-10 15:28:17,438 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-10 15:28:17,439 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-10 15:28:17,439 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-10 15:28:17,440 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~mem11;havoc #t~mem12;havoc #t~short13;havoc #t~short14; {5278#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 1))} is VALID [2020-07-10 15:28:17,440 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-10 15:28:17,441 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-10 15:28:17,441 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~mem16;havoc #t~short17;#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-10 15:28:17,442 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-10 15:28:17,442 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-10 15:28:17,442 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-10 15:28:17,442 INFO L280 TraceCheckUtils]: 38: Hoare triple {5176#true} assume true; {5176#true} is VALID [2020-07-10 15:28:17,443 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-10 15:28:17,444 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-10 15:28:17,444 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-10 15:28:17,445 INFO L280 TraceCheckUtils]: 42: Hoare triple {5325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:17,445 INFO L280 TraceCheckUtils]: 43: Hoare triple {5329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5177#false} is VALID [2020-07-10 15:28:17,445 INFO L280 TraceCheckUtils]: 44: Hoare triple {5177#false} assume !false; {5177#false} is VALID [2020-07-10 15:28:17,449 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-10 15:28:17,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:17,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-07-10 15:28:17,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688878111] [2020-07-10 15:28:17,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-10 15:28:17,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:17,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:28:17,556 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-10 15:28:17,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:28:17,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:28:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:28:17,557 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand 19 states. [2020-07-10 15:28:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:19,609 INFO L93 Difference]: Finished difference Result 212 states and 267 transitions. [2020-07-10 15:28:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:28:19,609 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-07-10 15:28:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:28:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 197 transitions. [2020-07-10 15:28:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:28:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 197 transitions. [2020-07-10 15:28:19,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 197 transitions. [2020-07-10 15:28:19,863 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-10 15:28:19,868 INFO L225 Difference]: With dead ends: 212 [2020-07-10 15:28:19,868 INFO L226 Difference]: Without dead ends: 210 [2020-07-10 15:28:19,869 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-10 15:28:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-10 15:28:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2020-07-10 15:28:19,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:19,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 146 states. [2020-07-10 15:28:19,938 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 146 states. [2020-07-10 15:28:19,938 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 146 states. [2020-07-10 15:28:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:19,946 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2020-07-10 15:28:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 265 transitions. [2020-07-10 15:28:19,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:19,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:19,947 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 210 states. [2020-07-10 15:28:19,947 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 210 states. [2020-07-10 15:28:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:19,954 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2020-07-10 15:28:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 265 transitions. [2020-07-10 15:28:19,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:19,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:19,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:19,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-07-10 15:28:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2020-07-10 15:28:19,959 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 45 [2020-07-10 15:28:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:19,959 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2020-07-10 15:28:19,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:28:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2020-07-10 15:28:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:28:19,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:19,960 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-10 15:28:20,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-10 15:28:20,174 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1410343133, now seen corresponding path program 1 times [2020-07-10 15:28:20,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:20,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479626940] [2020-07-10 15:28:20,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:28:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:28:20,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:28:20,239 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:28:20,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:28:20,275 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-10 15:28:20,278 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-10 15:28:20,279 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-10 15:28:20,280 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-10 15:28:20,281 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-10 15:28:20,281 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-10 15:28:20,282 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-10 15:28:20,282 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-10 15:28:20,283 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-10 15:28:20,283 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-10 15:28:20,284 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-10 15:28:20,296 WARN L170 areAnnotationChecker]: parse_expression_listENTRY has no Hoare annotation [2020-07-10 15:28:20,297 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:28:20,297 WARN L170 areAnnotationChecker]: r_strncpyENTRY has no Hoare annotation [2020-07-10 15:28:20,297 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:28:20,297 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:28:20,297 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:28:20,298 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:28:20,298 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:28:20,298 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:28:20,298 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:20,298 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-10 15:28:20,298 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:28:20,299 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:28:20,299 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-10 15:28:20,299 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-10 15:28:20,300 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-10 15:28:20,300 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-10 15:28:20,300 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2020-07-10 15:28:20,301 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-10 15:28:20,301 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-10 15:28:20,301 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:20,301 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2020-07-10 15:28:20,301 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:20,301 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:28:20,302 WARN L170 areAnnotationChecker]: L51-5 has no Hoare annotation [2020-07-10 15:28:20,303 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2020-07-10 15:28:20,303 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:20,303 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:20,304 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-10 15:28:20,304 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-10 15:28:20,304 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:28:20,304 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-10 15:28:20,305 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-10 15:28:20,306 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:28:20,306 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:28:20,306 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:28:20,306 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-10 15:28:20,306 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-10 15:28:20,306 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-10 15:28:20,307 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-10 15:28:20,307 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-10 15:28:20,307 WARN L170 areAnnotationChecker]: L58-8 has no Hoare annotation [2020-07-10 15:28:20,307 WARN L170 areAnnotationChecker]: L58-8 has no Hoare annotation [2020-07-10 15:28:20,307 WARN L170 areAnnotationChecker]: L58-9 has no Hoare annotation [2020-07-10 15:28:20,307 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:28:20,308 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:28:20,308 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-10 15:28:20,308 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-10 15:28:20,308 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-10 15:28:20,308 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-10 15:28:20,308 WARN L170 areAnnotationChecker]: L58-6 has no Hoare annotation [2020-07-10 15:28:20,309 WARN L170 areAnnotationChecker]: L58-6 has no Hoare annotation [2020-07-10 15:28:20,309 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-10 15:28:20,309 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-10 15:28:20,309 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2020-07-10 15:28:20,309 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-10 15:28:20,309 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-10 15:28:20,310 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:28:20,310 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:28:20,310 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-10 15:28:20,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:20 BoogieIcfgContainer [2020-07-10 15:28:20,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:20,325 INFO L168 Benchmark]: Toolchain (without parser) took 18046.11 ms. Allocated memory was 144.2 MB in the beginning and 389.5 MB in the end (delta: 245.4 MB). Free memory was 101.7 MB in the beginning and 279.1 MB in the end (delta: -177.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:20,325 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:20,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.23 ms. Allocated memory is still 144.2 MB. Free memory was 101.3 MB in the beginning and 88.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:20,326 INFO L168 Benchmark]: Boogie Preprocessor took 160.01 ms. Allocated memory was 144.2 MB in the beginning and 199.8 MB in the end (delta: 55.6 MB). Free memory was 88.6 MB in the beginning and 175.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:20,327 INFO L168 Benchmark]: RCFGBuilder took 610.74 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 136.5 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:20,329 INFO L168 Benchmark]: TraceAbstraction took 16955.53 ms. Allocated memory was 199.8 MB in the beginning and 389.5 MB in the end (delta: 189.8 MB). Free memory was 135.8 MB in the beginning and 279.1 MB in the end (delta: -143.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:20,335 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.26 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.23 ms. Allocated memory is still 144.2 MB. Free memory was 101.3 MB in the beginning and 88.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.01 ms. Allocated memory was 144.2 MB in the beginning and 199.8 MB in the end (delta: 55.6 MB). Free memory was 88.6 MB in the beginning and 175.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 610.74 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 136.5 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16955.53 ms. Allocated memory was 199.8 MB in the beginning and 389.5 MB in the end (delta: 189.8 MB). Free memory was 135.8 MB in the beginning and 279.1 MB in the end (delta: -143.4 MB). Peak memory consumption was 46.4 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: 16.8s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 11.3s, 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, 3.0s 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.5s 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...