/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:46,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:46,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:46,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:46,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:46,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:46,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:46,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:46,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:46,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:46,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:46,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:46,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:46,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:46,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:46,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:46,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:46,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:46,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:46,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:46,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:46,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:46,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:46,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:46,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:46,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:46,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:46,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:46,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:46,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:46,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:46,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:46,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:46,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:46,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:46,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:46,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:46,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:46,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:46,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:46,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:46,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:46,491 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:46,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:46,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:46,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:46,494 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:46,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:46,494 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:46,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:46,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:46,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:46,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:46,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:46,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:46,496 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:46,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:46,496 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:46,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:46,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:46,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:46,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:46,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:46,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:46,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:46,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:46,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:46,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:46,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:46,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:46,499 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:46,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:46,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:46,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:46,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:46,839 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:46,839 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:46,840 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-17 22:50:46,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e552b29/a3659c582b9d42698bd2a95dd3d39c58/FLAGcb5c57d21 [2020-07-17 22:50:47,438 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:47,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-17 22:50:47,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e552b29/a3659c582b9d42698bd2a95dd3d39c58/FLAGcb5c57d21 [2020-07-17 22:50:47,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e552b29/a3659c582b9d42698bd2a95dd3d39c58 [2020-07-17 22:50:47,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:47,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:47,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:47,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:47,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:47,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:47" (1/1) ... [2020-07-17 22:50:47,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456872f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:47, skipping insertion in model container [2020-07-17 22:50:47,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:47" (1/1) ... [2020-07-17 22:50:47,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:47,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:48,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:48,029 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:48,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:48,191 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:48,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48 WrapperNode [2020-07-17 22:50:48,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:48,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:48,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:48,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:48,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... [2020-07-17 22:50:48,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:48,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:48,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:48,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:48,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:48,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:48,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:48,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:48,322 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-07-17 22:50:48,323 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-07-17 22:50:48,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-17 22:50:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-07-17 22:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-07-17 22:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-07-17 22:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-17 22:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-07-17 22:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-07-17 22:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-07-17 22:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-07-17 22:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-07-17 22:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-07-17 22:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-17 22:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-07-17 22:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-07-17 22:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-17 22:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-07-17 22:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-07-17 22:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-07-17 22:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-07-17 22:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-07-17 22:50:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-07-17 22:50:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:48,950 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:48,951 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:50:48,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:48 BoogieIcfgContainer [2020-07-17 22:50:48,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:48,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:48,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:48,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:48,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:47" (1/3) ... [2020-07-17 22:50:48,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aebb82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:48, skipping insertion in model container [2020-07-17 22:50:48,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:48" (2/3) ... [2020-07-17 22:50:48,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aebb82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:48, skipping insertion in model container [2020-07-17 22:50:48,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:48" (3/3) ... [2020-07-17 22:50:48,966 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-17 22:50:48,979 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:48,988 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:49,002 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:49,028 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:49,029 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:49,029 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:49,029 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:49,030 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:49,030 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:49,030 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:49,030 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-17 22:50:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:50:49,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:49,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:49,058 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1663477819, now seen corresponding path program 1 times [2020-07-17 22:50:49,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:49,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804209271] [2020-07-17 22:50:49,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:49,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2020-07-17 22:50:49,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-17 22:50:49,323 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #151#return; {58#true} is VALID [2020-07-17 22:50:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:49,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {58#true} is VALID [2020-07-17 22:50:49,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-17 22:50:49,358 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {59#false} #147#return; {59#false} is VALID [2020-07-17 22:50:49,359 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:49,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2020-07-17 22:50:49,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-17 22:50:49,360 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #151#return; {58#true} is VALID [2020-07-17 22:50:49,361 INFO L263 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret23 := main(); {58#true} is VALID [2020-07-17 22:50:49,362 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {63#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:49,363 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#(= 0 main_~i~1)} assume !(~i~1 < 8); {59#false} is VALID [2020-07-17 22:50:49,364 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {59#false} is VALID [2020-07-17 22:50:49,364 INFO L263 TraceCheckUtils]: 8: Hoare triple {59#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {59#false} is VALID [2020-07-17 22:50:49,364 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {59#false} is VALID [2020-07-17 22:50:49,365 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#false} assume !(~str.base == 0 && ~str.offset == 0); {59#false} is VALID [2020-07-17 22:50:49,365 INFO L280 TraceCheckUtils]: 11: Hoare triple {59#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {59#false} is VALID [2020-07-17 22:50:49,365 INFO L280 TraceCheckUtils]: 12: Hoare triple {59#false} assume #t~switch4; {59#false} is VALID [2020-07-17 22:50:49,366 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#false} assume !true; {59#false} is VALID [2020-07-17 22:50:49,366 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {59#false} is VALID [2020-07-17 22:50:49,367 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {59#false} is VALID [2020-07-17 22:50:49,367 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#false} ~j~0 := ~i~0 - 1; {59#false} is VALID [2020-07-17 22:50:49,367 INFO L280 TraceCheckUtils]: 17: Hoare triple {59#false} assume !true; {59#false} is VALID [2020-07-17 22:50:49,368 INFO L280 TraceCheckUtils]: 18: Hoare triple {59#false} #t~short17 := 0 < ~j~0; {59#false} is VALID [2020-07-17 22:50:49,368 INFO L280 TraceCheckUtils]: 19: Hoare triple {59#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {59#false} is VALID [2020-07-17 22:50:49,368 INFO L280 TraceCheckUtils]: 20: Hoare triple {59#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {59#false} is VALID [2020-07-17 22:50:49,369 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} assume ~start~0 <= ~j~0; {59#false} is VALID [2020-07-17 22:50:49,369 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume !(1 + (~j~0 - ~start~0) >= 2); {59#false} is VALID [2020-07-17 22:50:49,369 INFO L263 TraceCheckUtils]: 23: Hoare triple {59#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {58#true} is VALID [2020-07-17 22:50:49,370 INFO L280 TraceCheckUtils]: 24: Hoare triple {58#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {58#true} is VALID [2020-07-17 22:50:49,370 INFO L280 TraceCheckUtils]: 25: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-17 22:50:49,370 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {58#true} {59#false} #147#return; {59#false} is VALID [2020-07-17 22:50:49,371 INFO L280 TraceCheckUtils]: 27: Hoare triple {59#false} havoc #t~ret19.base, #t~ret19.offset; {59#false} is VALID [2020-07-17 22:50:49,371 INFO L263 TraceCheckUtils]: 28: Hoare triple {59#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {59#false} is VALID [2020-07-17 22:50:49,371 INFO L280 TraceCheckUtils]: 29: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-17 22:50:49,372 INFO L280 TraceCheckUtils]: 30: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-17 22:50:49,372 INFO L280 TraceCheckUtils]: 31: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-17 22:50:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:49,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804209271] [2020-07-17 22:50:49,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:49,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:49,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748180855] [2020-07-17 22:50:49,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-17 22:50:49,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:49,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:49,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:49,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:49,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:49,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:49,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:49,464 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2020-07-17 22:50:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:49,937 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2020-07-17 22:50:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:49,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-17 22:50:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-17 22:50:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-17 22:50:49,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2020-07-17 22:50:50,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:50,161 INFO L225 Difference]: With dead ends: 104 [2020-07-17 22:50:50,161 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:50:50,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:50:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-17 22:50:50,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:50,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-17 22:50:50,223 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-17 22:50:50,223 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-17 22:50:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:50,230 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-17 22:50:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-17 22:50:50,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:50,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:50,231 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-17 22:50:50,231 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-17 22:50:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:50,236 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-17 22:50:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-17 22:50:50,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:50,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:50,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:50,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 22:50:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2020-07-17 22:50:50,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2020-07-17 22:50:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:50,245 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2020-07-17 22:50:50,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:50:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:50:50,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:50,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:50,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:50,248 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash 227833136, now seen corresponding path program 1 times [2020-07-17 22:50:50,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:50,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018870367] [2020-07-17 22:50:50,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-17 22:50:50,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-17 22:50:50,371 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-17 22:50:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {359#true} is VALID [2020-07-17 22:50:50,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-17 22:50:50,393 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {359#true} {360#false} #147#return; {360#false} is VALID [2020-07-17 22:50:50,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:50,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-17 22:50:50,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-17 22:50:50,396 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-17 22:50:50,396 INFO L263 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret23 := main(); {359#true} is VALID [2020-07-17 22:50:50,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {359#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {364#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:50,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {364#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:50,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {365#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:50,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {365#(<= main_~i~1 1)} assume !(~i~1 < 8); {360#false} is VALID [2020-07-17 22:50:50,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {360#false} is VALID [2020-07-17 22:50:50,403 INFO L263 TraceCheckUtils]: 10: Hoare triple {360#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {360#false} is VALID [2020-07-17 22:50:50,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {360#false} is VALID [2020-07-17 22:50:50,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#false} assume !(~str.base == 0 && ~str.offset == 0); {360#false} is VALID [2020-07-17 22:50:50,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {360#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {360#false} is VALID [2020-07-17 22:50:50,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#false} assume #t~switch4; {360#false} is VALID [2020-07-17 22:50:50,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {360#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {360#false} is VALID [2020-07-17 22:50:50,406 INFO L280 TraceCheckUtils]: 16: Hoare triple {360#false} assume #t~short7; {360#false} is VALID [2020-07-17 22:50:50,406 INFO L280 TraceCheckUtils]: 17: Hoare triple {360#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {360#false} is VALID [2020-07-17 22:50:50,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {360#false} is VALID [2020-07-17 22:50:50,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {360#false} is VALID [2020-07-17 22:50:50,407 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#false} ~j~0 := ~i~0 - 1; {360#false} is VALID [2020-07-17 22:50:50,409 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#false} #t~short14 := 0 < ~j~0; {360#false} is VALID [2020-07-17 22:50:50,410 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#false} assume !#t~short14; {360#false} is VALID [2020-07-17 22:50:50,410 INFO L280 TraceCheckUtils]: 23: Hoare triple {360#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {360#false} is VALID [2020-07-17 22:50:50,411 INFO L280 TraceCheckUtils]: 24: Hoare triple {360#false} #t~short17 := 0 < ~j~0; {360#false} is VALID [2020-07-17 22:50:50,411 INFO L280 TraceCheckUtils]: 25: Hoare triple {360#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {360#false} is VALID [2020-07-17 22:50:50,411 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {360#false} is VALID [2020-07-17 22:50:50,412 INFO L280 TraceCheckUtils]: 27: Hoare triple {360#false} assume ~start~0 <= ~j~0; {360#false} is VALID [2020-07-17 22:50:50,412 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#false} assume !(1 + (~j~0 - ~start~0) >= 2); {360#false} is VALID [2020-07-17 22:50:50,412 INFO L263 TraceCheckUtils]: 29: Hoare triple {360#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {359#true} is VALID [2020-07-17 22:50:50,413 INFO L280 TraceCheckUtils]: 30: Hoare triple {359#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {359#true} is VALID [2020-07-17 22:50:50,413 INFO L280 TraceCheckUtils]: 31: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-17 22:50:50,413 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {359#true} {360#false} #147#return; {360#false} is VALID [2020-07-17 22:50:50,414 INFO L280 TraceCheckUtils]: 33: Hoare triple {360#false} havoc #t~ret19.base, #t~ret19.offset; {360#false} is VALID [2020-07-17 22:50:50,414 INFO L263 TraceCheckUtils]: 34: Hoare triple {360#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {360#false} is VALID [2020-07-17 22:50:50,414 INFO L280 TraceCheckUtils]: 35: Hoare triple {360#false} ~cond := #in~cond; {360#false} is VALID [2020-07-17 22:50:50,415 INFO L280 TraceCheckUtils]: 36: Hoare triple {360#false} assume 0 == ~cond; {360#false} is VALID [2020-07-17 22:50:50,415 INFO L280 TraceCheckUtils]: 37: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-17 22:50:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:50,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018870367] [2020-07-17 22:50:50,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201070712] [2020-07-17 22:50:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-17 22:50:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:50,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:50,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {359#true} is VALID [2020-07-17 22:50:50,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-17 22:50:50,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2020-07-17 22:50:50,609 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #151#return; {359#true} is VALID [2020-07-17 22:50:50,609 INFO L263 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret23 := main(); {359#true} is VALID [2020-07-17 22:50:50,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {359#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {359#true} is VALID [2020-07-17 22:50:50,610 INFO L280 TraceCheckUtils]: 6: Hoare triple {359#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {359#true} is VALID [2020-07-17 22:50:50,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {359#true} is VALID [2020-07-17 22:50:50,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#true} assume !(~i~1 < 8); {359#true} is VALID [2020-07-17 22:50:50,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {359#true} is VALID [2020-07-17 22:50:50,611 INFO L263 TraceCheckUtils]: 10: Hoare triple {359#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {359#true} is VALID [2020-07-17 22:50:50,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {359#true} is VALID [2020-07-17 22:50:50,612 INFO L280 TraceCheckUtils]: 12: Hoare triple {359#true} assume !(~str.base == 0 && ~str.offset == 0); {359#true} is VALID [2020-07-17 22:50:50,612 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {359#true} is VALID [2020-07-17 22:50:50,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#true} assume #t~switch4; {359#true} is VALID [2020-07-17 22:50:50,613 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {359#true} is VALID [2020-07-17 22:50:50,614 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#true} assume #t~short7; {421#|parse_expression_list_#t~short7|} is VALID [2020-07-17 22:50:50,615 INFO L280 TraceCheckUtils]: 17: Hoare triple {421#|parse_expression_list_#t~short7|} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {360#false} is VALID [2020-07-17 22:50:50,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {360#false} is VALID [2020-07-17 22:50:50,616 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {360#false} is VALID [2020-07-17 22:50:50,617 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#false} ~j~0 := ~i~0 - 1; {360#false} is VALID [2020-07-17 22:50:50,617 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#false} #t~short14 := 0 < ~j~0; {360#false} is VALID [2020-07-17 22:50:50,617 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#false} assume !#t~short14; {360#false} is VALID [2020-07-17 22:50:50,618 INFO L280 TraceCheckUtils]: 23: Hoare triple {360#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {360#false} is VALID [2020-07-17 22:50:50,618 INFO L280 TraceCheckUtils]: 24: Hoare triple {360#false} #t~short17 := 0 < ~j~0; {360#false} is VALID [2020-07-17 22:50:50,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {360#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {360#false} is VALID [2020-07-17 22:50:50,619 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {360#false} is VALID [2020-07-17 22:50:50,619 INFO L280 TraceCheckUtils]: 27: Hoare triple {360#false} assume ~start~0 <= ~j~0; {360#false} is VALID [2020-07-17 22:50:50,620 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#false} assume !(1 + (~j~0 - ~start~0) >= 2); {360#false} is VALID [2020-07-17 22:50:50,620 INFO L263 TraceCheckUtils]: 29: Hoare triple {360#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {360#false} is VALID [2020-07-17 22:50:50,620 INFO L280 TraceCheckUtils]: 30: Hoare triple {360#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {360#false} is VALID [2020-07-17 22:50:50,621 INFO L280 TraceCheckUtils]: 31: Hoare triple {360#false} assume true; {360#false} is VALID [2020-07-17 22:50:50,621 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {360#false} {360#false} #147#return; {360#false} is VALID [2020-07-17 22:50:50,622 INFO L280 TraceCheckUtils]: 33: Hoare triple {360#false} havoc #t~ret19.base, #t~ret19.offset; {360#false} is VALID [2020-07-17 22:50:50,622 INFO L263 TraceCheckUtils]: 34: Hoare triple {360#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {360#false} is VALID [2020-07-17 22:50:50,622 INFO L280 TraceCheckUtils]: 35: Hoare triple {360#false} ~cond := #in~cond; {360#false} is VALID [2020-07-17 22:50:50,623 INFO L280 TraceCheckUtils]: 36: Hoare triple {360#false} assume 0 == ~cond; {360#false} is VALID [2020-07-17 22:50:50,623 INFO L280 TraceCheckUtils]: 37: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-17 22:50:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:50:50,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:50,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-17 22:50:50,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510963944] [2020-07-17 22:50:50,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-17 22:50:50,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:50,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:50,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:50,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:50,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:50,723 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2020-07-17 22:50:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:50,868 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-07-17 22:50:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:50,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-17 22:50:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-17 22:50:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-17 22:50:50,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-17 22:50:51,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:51,013 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:50:51,013 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:50:51,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:50:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-17 22:50:51,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:51,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-17 22:50:51,034 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-17 22:50:51,034 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-17 22:50:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:51,038 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-17 22:50:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-17 22:50:51,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:51,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:51,040 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-17 22:50:51,040 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-17 22:50:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:51,043 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-17 22:50:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-17 22:50:51,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:51,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:51,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:51,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-17 22:50:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2020-07-17 22:50:51,048 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 38 [2020-07-17 22:50:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:51,048 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2020-07-17 22:50:51,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2020-07-17 22:50:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:50:51,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:51,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:51,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:50:51,261 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash 446687854, now seen corresponding path program 1 times [2020-07-17 22:50:51,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:51,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696640766] [2020-07-17 22:50:51,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-17 22:50:51,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-17 22:50:51,347 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-17 22:50:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {752#true} is VALID [2020-07-17 22:50:51,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-17 22:50:51,355 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {753#false} #147#return; {753#false} is VALID [2020-07-17 22:50:51,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:51,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-17 22:50:51,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-17 22:50:51,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-17 22:50:51,357 INFO L263 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret23 := main(); {752#true} is VALID [2020-07-17 22:50:51,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {757#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:51,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {757#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:51,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {758#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:51,360 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(<= main_~i~1 1)} assume !(~i~1 < 8); {753#false} is VALID [2020-07-17 22:50:51,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {753#false} is VALID [2020-07-17 22:50:51,361 INFO L263 TraceCheckUtils]: 10: Hoare triple {753#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {753#false} is VALID [2020-07-17 22:50:51,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {753#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {753#false} is VALID [2020-07-17 22:50:51,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#false} assume !(~str.base == 0 && ~str.offset == 0); {753#false} is VALID [2020-07-17 22:50:51,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {753#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {753#false} is VALID [2020-07-17 22:50:51,362 INFO L280 TraceCheckUtils]: 14: Hoare triple {753#false} assume #t~switch4; {753#false} is VALID [2020-07-17 22:50:51,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {753#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {753#false} is VALID [2020-07-17 22:50:51,363 INFO L280 TraceCheckUtils]: 16: Hoare triple {753#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {753#false} is VALID [2020-07-17 22:50:51,363 INFO L280 TraceCheckUtils]: 17: Hoare triple {753#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {753#false} is VALID [2020-07-17 22:50:51,363 INFO L280 TraceCheckUtils]: 18: Hoare triple {753#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {753#false} is VALID [2020-07-17 22:50:51,364 INFO L280 TraceCheckUtils]: 19: Hoare triple {753#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {753#false} is VALID [2020-07-17 22:50:51,364 INFO L280 TraceCheckUtils]: 20: Hoare triple {753#false} ~j~0 := ~i~0 - 1; {753#false} is VALID [2020-07-17 22:50:51,364 INFO L280 TraceCheckUtils]: 21: Hoare triple {753#false} #t~short14 := 0 < ~j~0; {753#false} is VALID [2020-07-17 22:50:51,364 INFO L280 TraceCheckUtils]: 22: Hoare triple {753#false} assume !#t~short14; {753#false} is VALID [2020-07-17 22:50:51,365 INFO L280 TraceCheckUtils]: 23: Hoare triple {753#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {753#false} is VALID [2020-07-17 22:50:51,365 INFO L280 TraceCheckUtils]: 24: Hoare triple {753#false} #t~short17 := 0 < ~j~0; {753#false} is VALID [2020-07-17 22:50:51,365 INFO L280 TraceCheckUtils]: 25: Hoare triple {753#false} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {753#false} is VALID [2020-07-17 22:50:51,365 INFO L280 TraceCheckUtils]: 26: Hoare triple {753#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {753#false} is VALID [2020-07-17 22:50:51,366 INFO L280 TraceCheckUtils]: 27: Hoare triple {753#false} assume ~start~0 <= ~j~0; {753#false} is VALID [2020-07-17 22:50:51,366 INFO L280 TraceCheckUtils]: 28: Hoare triple {753#false} assume !(1 + (~j~0 - ~start~0) >= 2); {753#false} is VALID [2020-07-17 22:50:51,367 INFO L263 TraceCheckUtils]: 29: Hoare triple {753#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {752#true} is VALID [2020-07-17 22:50:51,367 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {752#true} is VALID [2020-07-17 22:50:51,367 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-17 22:50:51,367 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {752#true} {753#false} #147#return; {753#false} is VALID [2020-07-17 22:50:51,368 INFO L280 TraceCheckUtils]: 33: Hoare triple {753#false} havoc #t~ret19.base, #t~ret19.offset; {753#false} is VALID [2020-07-17 22:50:51,368 INFO L263 TraceCheckUtils]: 34: Hoare triple {753#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {753#false} is VALID [2020-07-17 22:50:51,368 INFO L280 TraceCheckUtils]: 35: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2020-07-17 22:50:51,369 INFO L280 TraceCheckUtils]: 36: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2020-07-17 22:50:51,369 INFO L280 TraceCheckUtils]: 37: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-17 22:50:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:51,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696640766] [2020-07-17 22:50:51,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336738731] [2020-07-17 22:50:51,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:51,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:51,520 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:51,544 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:51,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-17 22:50:51,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {752#true} is VALID [2020-07-17 22:50:51,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-17 22:50:51,573 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-17 22:50:51,574 INFO L263 TraceCheckUtils]: 4: Hoare triple {752#true} call #t~ret23 := main(); {752#true} is VALID [2020-07-17 22:50:51,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {752#true} is VALID [2020-07-17 22:50:51,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {752#true} is VALID [2020-07-17 22:50:51,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {752#true} is VALID [2020-07-17 22:50:51,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume !(~i~1 < 8); {752#true} is VALID [2020-07-17 22:50:51,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {752#true} is VALID [2020-07-17 22:50:51,575 INFO L263 TraceCheckUtils]: 10: Hoare triple {752#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {752#true} is VALID [2020-07-17 22:50:51,575 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {752#true} is VALID [2020-07-17 22:50:51,576 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume !(~str.base == 0 && ~str.offset == 0); {752#true} is VALID [2020-07-17 22:50:51,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {752#true} is VALID [2020-07-17 22:50:51,576 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} assume #t~switch4; {752#true} is VALID [2020-07-17 22:50:51,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {752#true} is VALID [2020-07-17 22:50:51,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {752#true} is VALID [2020-07-17 22:50:51,577 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {752#true} is VALID [2020-07-17 22:50:51,577 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {752#true} is VALID [2020-07-17 22:50:51,578 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {752#true} is VALID [2020-07-17 22:50:51,578 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} ~j~0 := ~i~0 - 1; {752#true} is VALID [2020-07-17 22:50:51,579 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} #t~short14 := 0 < ~j~0; {829#(or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|))} is VALID [2020-07-17 22:50:51,581 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#(or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|))} assume !#t~short14; {833#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-17 22:50:51,582 INFO L280 TraceCheckUtils]: 23: Hoare triple {833#(<= parse_expression_list_~j~0 0)} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {833#(<= parse_expression_list_~j~0 0)} is VALID [2020-07-17 22:50:51,582 INFO L280 TraceCheckUtils]: 24: Hoare triple {833#(<= parse_expression_list_~j~0 0)} #t~short17 := 0 < ~j~0; {840#(not |parse_expression_list_#t~short17|)} is VALID [2020-07-17 22:50:51,583 INFO L280 TraceCheckUtils]: 25: Hoare triple {840#(not |parse_expression_list_#t~short17|)} assume #t~short17;call #t~mem16 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short17 := 34 == #t~mem16; {753#false} is VALID [2020-07-17 22:50:51,583 INFO L280 TraceCheckUtils]: 26: Hoare triple {753#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {753#false} is VALID [2020-07-17 22:50:51,584 INFO L280 TraceCheckUtils]: 27: Hoare triple {753#false} assume ~start~0 <= ~j~0; {753#false} is VALID [2020-07-17 22:50:51,584 INFO L280 TraceCheckUtils]: 28: Hoare triple {753#false} assume !(1 + (~j~0 - ~start~0) >= 2); {753#false} is VALID [2020-07-17 22:50:51,584 INFO L263 TraceCheckUtils]: 29: Hoare triple {753#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {753#false} is VALID [2020-07-17 22:50:51,584 INFO L280 TraceCheckUtils]: 30: Hoare triple {753#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {753#false} is VALID [2020-07-17 22:50:51,585 INFO L280 TraceCheckUtils]: 31: Hoare triple {753#false} assume true; {753#false} is VALID [2020-07-17 22:50:51,585 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {753#false} {753#false} #147#return; {753#false} is VALID [2020-07-17 22:50:51,585 INFO L280 TraceCheckUtils]: 33: Hoare triple {753#false} havoc #t~ret19.base, #t~ret19.offset; {753#false} is VALID [2020-07-17 22:50:51,585 INFO L263 TraceCheckUtils]: 34: Hoare triple {753#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {753#false} is VALID [2020-07-17 22:50:51,586 INFO L280 TraceCheckUtils]: 35: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2020-07-17 22:50:51,586 INFO L280 TraceCheckUtils]: 36: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2020-07-17 22:50:51,586 INFO L280 TraceCheckUtils]: 37: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-17 22:50:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:50:51,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:51,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-17 22:50:51,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288003306] [2020-07-17 22:50:51,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-17 22:50:51,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:51,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:51,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:51,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:51,634 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2020-07-17 22:50:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:51,993 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2020-07-17 22:50:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:51,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-17 22:50:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2020-07-17 22:50:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2020-07-17 22:50:52,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2020-07-17 22:50:52,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:52,160 INFO L225 Difference]: With dead ends: 109 [2020-07-17 22:50:52,161 INFO L226 Difference]: Without dead ends: 73 [2020-07-17 22:50:52,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-17 22:50:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2020-07-17 22:50:52,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:52,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 53 states. [2020-07-17 22:50:52,192 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 53 states. [2020-07-17 22:50:52,192 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 53 states. [2020-07-17 22:50:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:52,199 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-17 22:50:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-17 22:50:52,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:52,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:52,209 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 73 states. [2020-07-17 22:50:52,209 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 73 states. [2020-07-17 22:50:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:52,214 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-17 22:50:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-17 22:50:52,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:52,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:52,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:52,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:50:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2020-07-17 22:50:52,221 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 38 [2020-07-17 22:50:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:52,223 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2020-07-17 22:50:52,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2020-07-17 22:50:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:50:52,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:52,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:52,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:52,443 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -140118160, now seen corresponding path program 1 times [2020-07-17 22:50:52,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:52,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233612996] [2020-07-17 22:50:52,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-17 22:50:52,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-17 22:50:52,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-17 22:50:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,549 INFO L280 TraceCheckUtils]: 0: Hoare triple {1232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1232#true} is VALID [2020-07-17 22:50:52,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-17 22:50:52,550 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1233#false} #147#return; {1233#false} is VALID [2020-07-17 22:50:52,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:52,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {1242#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-17 22:50:52,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-17 22:50:52,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-17 22:50:52,555 INFO L263 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret23 := main(); {1232#true} is VALID [2020-07-17 22:50:52,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {1232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1237#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:52,557 INFO L280 TraceCheckUtils]: 6: Hoare triple {1237#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1237#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:52,557 INFO L280 TraceCheckUtils]: 7: Hoare triple {1237#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1238#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:52,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {1238#(<= main_~i~1 1)} assume !(~i~1 < 8); {1233#false} is VALID [2020-07-17 22:50:52,558 INFO L280 TraceCheckUtils]: 9: Hoare triple {1233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1233#false} is VALID [2020-07-17 22:50:52,559 INFO L263 TraceCheckUtils]: 10: Hoare triple {1233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1233#false} is VALID [2020-07-17 22:50:52,559 INFO L280 TraceCheckUtils]: 11: Hoare triple {1233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1233#false} is VALID [2020-07-17 22:50:52,559 INFO L280 TraceCheckUtils]: 12: Hoare triple {1233#false} assume !(~str.base == 0 && ~str.offset == 0); {1233#false} is VALID [2020-07-17 22:50:52,559 INFO L280 TraceCheckUtils]: 13: Hoare triple {1233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1233#false} is VALID [2020-07-17 22:50:52,560 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#false} assume #t~switch4; {1233#false} is VALID [2020-07-17 22:50:52,560 INFO L280 TraceCheckUtils]: 15: Hoare triple {1233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1233#false} is VALID [2020-07-17 22:50:52,564 INFO L280 TraceCheckUtils]: 16: Hoare triple {1233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1233#false} is VALID [2020-07-17 22:50:52,564 INFO L280 TraceCheckUtils]: 17: Hoare triple {1233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1233#false} is VALID [2020-07-17 22:50:52,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {1233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1233#false} is VALID [2020-07-17 22:50:52,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1233#false} is VALID [2020-07-17 22:50:52,565 INFO L280 TraceCheckUtils]: 20: Hoare triple {1233#false} ~j~0 := ~i~0 - 1; {1233#false} is VALID [2020-07-17 22:50:52,565 INFO L280 TraceCheckUtils]: 21: Hoare triple {1233#false} #t~short14 := 0 < ~j~0; {1233#false} is VALID [2020-07-17 22:50:52,565 INFO L280 TraceCheckUtils]: 22: Hoare triple {1233#false} assume !#t~short14; {1233#false} is VALID [2020-07-17 22:50:52,566 INFO L280 TraceCheckUtils]: 23: Hoare triple {1233#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {1233#false} is VALID [2020-07-17 22:50:52,566 INFO L280 TraceCheckUtils]: 24: Hoare triple {1233#false} #t~short17 := 0 < ~j~0; {1233#false} is VALID [2020-07-17 22:50:52,566 INFO L280 TraceCheckUtils]: 25: Hoare triple {1233#false} assume !#t~short17; {1233#false} is VALID [2020-07-17 22:50:52,567 INFO L280 TraceCheckUtils]: 26: Hoare triple {1233#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {1233#false} is VALID [2020-07-17 22:50:52,567 INFO L280 TraceCheckUtils]: 27: Hoare triple {1233#false} assume ~start~0 <= ~j~0; {1233#false} is VALID [2020-07-17 22:50:52,567 INFO L280 TraceCheckUtils]: 28: Hoare triple {1233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1233#false} is VALID [2020-07-17 22:50:52,567 INFO L263 TraceCheckUtils]: 29: Hoare triple {1233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1232#true} is VALID [2020-07-17 22:50:52,567 INFO L280 TraceCheckUtils]: 30: Hoare triple {1232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1232#true} is VALID [2020-07-17 22:50:52,568 INFO L280 TraceCheckUtils]: 31: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-17 22:50:52,568 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1232#true} {1233#false} #147#return; {1233#false} is VALID [2020-07-17 22:50:52,568 INFO L280 TraceCheckUtils]: 33: Hoare triple {1233#false} havoc #t~ret19.base, #t~ret19.offset; {1233#false} is VALID [2020-07-17 22:50:52,568 INFO L263 TraceCheckUtils]: 34: Hoare triple {1233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1233#false} is VALID [2020-07-17 22:50:52,568 INFO L280 TraceCheckUtils]: 35: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2020-07-17 22:50:52,568 INFO L280 TraceCheckUtils]: 36: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2020-07-17 22:50:52,569 INFO L280 TraceCheckUtils]: 37: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2020-07-17 22:50:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:52,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233612996] [2020-07-17 22:50:52,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608304137] [2020-07-17 22:50:52,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:50:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:52,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:52,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1232#true} is VALID [2020-07-17 22:50:52,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1232#true} is VALID [2020-07-17 22:50:52,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2020-07-17 22:50:52,712 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2020-07-17 22:50:52,712 INFO L263 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret23 := main(); {1232#true} is VALID [2020-07-17 22:50:52,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {1232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1261#(<= main_~i~1 0)} is VALID [2020-07-17 22:50:52,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {1261#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1261#(<= main_~i~1 0)} is VALID [2020-07-17 22:50:52,715 INFO L280 TraceCheckUtils]: 7: Hoare triple {1261#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1238#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:52,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {1238#(<= main_~i~1 1)} assume !(~i~1 < 8); {1233#false} is VALID [2020-07-17 22:50:52,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {1233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1233#false} is VALID [2020-07-17 22:50:52,717 INFO L263 TraceCheckUtils]: 10: Hoare triple {1233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1233#false} is VALID [2020-07-17 22:50:52,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {1233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1233#false} is VALID [2020-07-17 22:50:52,717 INFO L280 TraceCheckUtils]: 12: Hoare triple {1233#false} assume !(~str.base == 0 && ~str.offset == 0); {1233#false} is VALID [2020-07-17 22:50:52,718 INFO L280 TraceCheckUtils]: 13: Hoare triple {1233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1233#false} is VALID [2020-07-17 22:50:52,718 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#false} assume #t~switch4; {1233#false} is VALID [2020-07-17 22:50:52,718 INFO L280 TraceCheckUtils]: 15: Hoare triple {1233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1233#false} is VALID [2020-07-17 22:50:52,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {1233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1233#false} is VALID [2020-07-17 22:50:52,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {1233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1233#false} is VALID [2020-07-17 22:50:52,719 INFO L280 TraceCheckUtils]: 18: Hoare triple {1233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1233#false} is VALID [2020-07-17 22:50:52,719 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1233#false} is VALID [2020-07-17 22:50:52,719 INFO L280 TraceCheckUtils]: 20: Hoare triple {1233#false} ~j~0 := ~i~0 - 1; {1233#false} is VALID [2020-07-17 22:50:52,720 INFO L280 TraceCheckUtils]: 21: Hoare triple {1233#false} #t~short14 := 0 < ~j~0; {1233#false} is VALID [2020-07-17 22:50:52,720 INFO L280 TraceCheckUtils]: 22: Hoare triple {1233#false} assume !#t~short14; {1233#false} is VALID [2020-07-17 22:50:52,720 INFO L280 TraceCheckUtils]: 23: Hoare triple {1233#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {1233#false} is VALID [2020-07-17 22:50:52,720 INFO L280 TraceCheckUtils]: 24: Hoare triple {1233#false} #t~short17 := 0 < ~j~0; {1233#false} is VALID [2020-07-17 22:50:52,721 INFO L280 TraceCheckUtils]: 25: Hoare triple {1233#false} assume !#t~short17; {1233#false} is VALID [2020-07-17 22:50:52,721 INFO L280 TraceCheckUtils]: 26: Hoare triple {1233#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {1233#false} is VALID [2020-07-17 22:50:52,721 INFO L280 TraceCheckUtils]: 27: Hoare triple {1233#false} assume ~start~0 <= ~j~0; {1233#false} is VALID [2020-07-17 22:50:52,721 INFO L280 TraceCheckUtils]: 28: Hoare triple {1233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1233#false} is VALID [2020-07-17 22:50:52,722 INFO L263 TraceCheckUtils]: 29: Hoare triple {1233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1233#false} is VALID [2020-07-17 22:50:52,722 INFO L280 TraceCheckUtils]: 30: Hoare triple {1233#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1233#false} is VALID [2020-07-17 22:50:52,722 INFO L280 TraceCheckUtils]: 31: Hoare triple {1233#false} assume true; {1233#false} is VALID [2020-07-17 22:50:52,722 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1233#false} {1233#false} #147#return; {1233#false} is VALID [2020-07-17 22:50:52,723 INFO L280 TraceCheckUtils]: 33: Hoare triple {1233#false} havoc #t~ret19.base, #t~ret19.offset; {1233#false} is VALID [2020-07-17 22:50:52,723 INFO L263 TraceCheckUtils]: 34: Hoare triple {1233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1233#false} is VALID [2020-07-17 22:50:52,723 INFO L280 TraceCheckUtils]: 35: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2020-07-17 22:50:52,723 INFO L280 TraceCheckUtils]: 36: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2020-07-17 22:50:52,724 INFO L280 TraceCheckUtils]: 37: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2020-07-17 22:50:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:52,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:52,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-17 22:50:52,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969345758] [2020-07-17 22:50:52,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-17 22:50:52,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:52,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:52,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:52,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:52,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:52,781 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2020-07-17 22:50:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:53,146 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2020-07-17 22:50:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:53,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-17 22:50:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-17 22:50:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-17 22:50:53,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2020-07-17 22:50:53,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:53,262 INFO L225 Difference]: With dead ends: 100 [2020-07-17 22:50:53,262 INFO L226 Difference]: Without dead ends: 56 [2020-07-17 22:50:53,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-17 22:50:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-07-17 22:50:53,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:53,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2020-07-17 22:50:53,295 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2020-07-17 22:50:53,295 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2020-07-17 22:50:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:53,298 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-17 22:50:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-17 22:50:53,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:53,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:53,299 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2020-07-17 22:50:53,299 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2020-07-17 22:50:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:53,302 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-17 22:50:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-17 22:50:53,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:53,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:53,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:53,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:50:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2020-07-17 22:50:53,306 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 38 [2020-07-17 22:50:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:53,306 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-07-17 22:50:53,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-17 22:50:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:50:53,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:53,307 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:53,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:53,524 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1477568014, now seen corresponding path program 2 times [2020-07-17 22:50:53,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:53,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804275872] [2020-07-17 22:50:53,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-17 22:50:53,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-17 22:50:53,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-17 22:50:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1665#true} is VALID [2020-07-17 22:50:53,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-17 22:50:53,661 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1666#false} #147#return; {1666#false} is VALID [2020-07-17 22:50:53,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:53,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-17 22:50:53,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-17 22:50:53,664 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-17 22:50:53,664 INFO L263 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret23 := main(); {1665#true} is VALID [2020-07-17 22:50:53,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1670#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:53,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {1670#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1670#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:53,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {1670#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1671#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:53,667 INFO L280 TraceCheckUtils]: 8: Hoare triple {1671#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1671#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:53,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {1671#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1672#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:53,668 INFO L280 TraceCheckUtils]: 10: Hoare triple {1672#(<= main_~i~1 2)} assume !(~i~1 < 8); {1666#false} is VALID [2020-07-17 22:50:53,669 INFO L280 TraceCheckUtils]: 11: Hoare triple {1666#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1666#false} is VALID [2020-07-17 22:50:53,669 INFO L263 TraceCheckUtils]: 12: Hoare triple {1666#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1666#false} is VALID [2020-07-17 22:50:53,669 INFO L280 TraceCheckUtils]: 13: Hoare triple {1666#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1666#false} is VALID [2020-07-17 22:50:53,669 INFO L280 TraceCheckUtils]: 14: Hoare triple {1666#false} assume !(~str.base == 0 && ~str.offset == 0); {1666#false} is VALID [2020-07-17 22:50:53,670 INFO L280 TraceCheckUtils]: 15: Hoare triple {1666#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1666#false} is VALID [2020-07-17 22:50:53,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {1666#false} assume #t~switch4; {1666#false} is VALID [2020-07-17 22:50:53,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {1666#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1666#false} is VALID [2020-07-17 22:50:53,670 INFO L280 TraceCheckUtils]: 18: Hoare triple {1666#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1666#false} is VALID [2020-07-17 22:50:53,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {1666#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1666#false} is VALID [2020-07-17 22:50:53,671 INFO L280 TraceCheckUtils]: 20: Hoare triple {1666#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1666#false} is VALID [2020-07-17 22:50:53,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {1666#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1666#false} is VALID [2020-07-17 22:50:53,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {1666#false} ~j~0 := ~i~0 - 1; {1666#false} is VALID [2020-07-17 22:50:53,672 INFO L280 TraceCheckUtils]: 23: Hoare triple {1666#false} #t~short14 := 0 < ~j~0; {1666#false} is VALID [2020-07-17 22:50:53,672 INFO L280 TraceCheckUtils]: 24: Hoare triple {1666#false} assume !#t~short14; {1666#false} is VALID [2020-07-17 22:50:53,672 INFO L280 TraceCheckUtils]: 25: Hoare triple {1666#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {1666#false} is VALID [2020-07-17 22:50:53,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {1666#false} #t~short17 := 0 < ~j~0; {1666#false} is VALID [2020-07-17 22:50:53,673 INFO L280 TraceCheckUtils]: 27: Hoare triple {1666#false} assume !#t~short17; {1666#false} is VALID [2020-07-17 22:50:53,673 INFO L280 TraceCheckUtils]: 28: Hoare triple {1666#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {1666#false} is VALID [2020-07-17 22:50:53,673 INFO L280 TraceCheckUtils]: 29: Hoare triple {1666#false} assume ~start~0 <= ~j~0; {1666#false} is VALID [2020-07-17 22:50:53,674 INFO L280 TraceCheckUtils]: 30: Hoare triple {1666#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1666#false} is VALID [2020-07-17 22:50:53,674 INFO L263 TraceCheckUtils]: 31: Hoare triple {1666#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1665#true} is VALID [2020-07-17 22:50:53,674 INFO L280 TraceCheckUtils]: 32: Hoare triple {1665#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1665#true} is VALID [2020-07-17 22:50:53,674 INFO L280 TraceCheckUtils]: 33: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-17 22:50:53,675 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1665#true} {1666#false} #147#return; {1666#false} is VALID [2020-07-17 22:50:53,675 INFO L280 TraceCheckUtils]: 35: Hoare triple {1666#false} havoc #t~ret19.base, #t~ret19.offset; {1666#false} is VALID [2020-07-17 22:50:53,675 INFO L263 TraceCheckUtils]: 36: Hoare triple {1666#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1666#false} is VALID [2020-07-17 22:50:53,676 INFO L280 TraceCheckUtils]: 37: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2020-07-17 22:50:53,676 INFO L280 TraceCheckUtils]: 38: Hoare triple {1666#false} assume 0 == ~cond; {1666#false} is VALID [2020-07-17 22:50:53,676 INFO L280 TraceCheckUtils]: 39: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-17 22:50:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:53,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804275872] [2020-07-17 22:50:53,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444971709] [2020-07-17 22:50:53,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:53,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-17 22:50:53,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:53,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:53,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:53,921 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2020-07-17 22:50:53,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1665#true} is VALID [2020-07-17 22:50:53,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-17 22:50:53,922 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #151#return; {1665#true} is VALID [2020-07-17 22:50:53,923 INFO L263 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret23 := main(); {1665#true} is VALID [2020-07-17 22:50:53,923 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1665#true} is VALID [2020-07-17 22:50:53,923 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1665#true} is VALID [2020-07-17 22:50:53,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1665#true} is VALID [2020-07-17 22:50:53,924 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {1665#true} is VALID [2020-07-17 22:50:53,924 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {1665#true} is VALID [2020-07-17 22:50:53,924 INFO L280 TraceCheckUtils]: 10: Hoare triple {1665#true} assume !(~i~1 < 8); {1665#true} is VALID [2020-07-17 22:50:53,924 INFO L280 TraceCheckUtils]: 11: Hoare triple {1665#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1665#true} is VALID [2020-07-17 22:50:53,925 INFO L263 TraceCheckUtils]: 12: Hoare triple {1665#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1665#true} is VALID [2020-07-17 22:50:53,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {1665#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:50:53,927 INFO L280 TraceCheckUtils]: 14: Hoare triple {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:50:53,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {1719#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,933 INFO L280 TraceCheckUtils]: 20: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,934 INFO L280 TraceCheckUtils]: 21: Hoare triple {1726#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {1745#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:53,935 INFO L280 TraceCheckUtils]: 22: Hoare triple {1745#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,936 INFO L280 TraceCheckUtils]: 23: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,940 INFO L280 TraceCheckUtils]: 27: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,940 INFO L280 TraceCheckUtils]: 28: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:53,941 INFO L280 TraceCheckUtils]: 29: Hoare triple {1749#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1666#false} is VALID [2020-07-17 22:50:53,941 INFO L280 TraceCheckUtils]: 30: Hoare triple {1666#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1666#false} is VALID [2020-07-17 22:50:53,942 INFO L263 TraceCheckUtils]: 31: Hoare triple {1666#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1666#false} is VALID [2020-07-17 22:50:53,942 INFO L280 TraceCheckUtils]: 32: Hoare triple {1666#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {1666#false} is VALID [2020-07-17 22:50:53,942 INFO L280 TraceCheckUtils]: 33: Hoare triple {1666#false} assume true; {1666#false} is VALID [2020-07-17 22:50:53,942 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1666#false} {1666#false} #147#return; {1666#false} is VALID [2020-07-17 22:50:53,943 INFO L280 TraceCheckUtils]: 35: Hoare triple {1666#false} havoc #t~ret19.base, #t~ret19.offset; {1666#false} is VALID [2020-07-17 22:50:53,943 INFO L263 TraceCheckUtils]: 36: Hoare triple {1666#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1666#false} is VALID [2020-07-17 22:50:53,943 INFO L280 TraceCheckUtils]: 37: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2020-07-17 22:50:53,943 INFO L280 TraceCheckUtils]: 38: Hoare triple {1666#false} assume 0 == ~cond; {1666#false} is VALID [2020-07-17 22:50:53,943 INFO L280 TraceCheckUtils]: 39: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-17 22:50:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:50:53,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:53,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-07-17 22:50:53,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866234492] [2020-07-17 22:50:53,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-17 22:50:53,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:53,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:54,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:54,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:54,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:54,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:54,012 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2020-07-17 22:50:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:54,565 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2020-07-17 22:50:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:54,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-17 22:50:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-17 22:50:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-17 22:50:54,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2020-07-17 22:50:54,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:54,769 INFO L225 Difference]: With dead ends: 147 [2020-07-17 22:50:54,769 INFO L226 Difference]: Without dead ends: 86 [2020-07-17 22:50:54,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:50:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-17 22:50:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 62. [2020-07-17 22:50:54,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:54,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 62 states. [2020-07-17 22:50:54,800 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 62 states. [2020-07-17 22:50:54,800 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 62 states. [2020-07-17 22:50:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:54,805 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2020-07-17 22:50:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-07-17 22:50:54,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:54,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:54,806 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 86 states. [2020-07-17 22:50:54,806 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 86 states. [2020-07-17 22:50:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:54,810 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2020-07-17 22:50:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-07-17 22:50:54,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:54,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:54,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:54,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-17 22:50:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2020-07-17 22:50:54,814 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 40 [2020-07-17 22:50:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:54,814 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-07-17 22:50:54,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2020-07-17 22:50:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:50:54,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:54,815 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:55,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:55,029 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1128455540, now seen corresponding path program 1 times [2020-07-17 22:50:55,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:55,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219211293] [2020-07-17 22:50:55,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-17 22:50:55,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-17 22:50:55,153 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-17 22:50:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {2232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2232#true} is VALID [2020-07-17 22:50:55,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-17 22:50:55,163 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2233#false} #147#return; {2233#false} is VALID [2020-07-17 22:50:55,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:55,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {2243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-17 22:50:55,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-17 22:50:55,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-17 22:50:55,165 INFO L263 TraceCheckUtils]: 4: Hoare triple {2232#true} call #t~ret23 := main(); {2232#true} is VALID [2020-07-17 22:50:55,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {2232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2237#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:55,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {2237#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2237#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:55,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {2237#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2238#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:55,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {2238#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2238#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:55,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {2238#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2239#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:55,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {2239#(<= main_~i~1 2)} assume !(~i~1 < 8); {2233#false} is VALID [2020-07-17 22:50:55,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {2233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2233#false} is VALID [2020-07-17 22:50:55,189 INFO L263 TraceCheckUtils]: 12: Hoare triple {2233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2233#false} is VALID [2020-07-17 22:50:55,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {2233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2233#false} is VALID [2020-07-17 22:50:55,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {2233#false} assume !(~str.base == 0 && ~str.offset == 0); {2233#false} is VALID [2020-07-17 22:50:55,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {2233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2233#false} is VALID [2020-07-17 22:50:55,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {2233#false} assume #t~switch4; {2233#false} is VALID [2020-07-17 22:50:55,190 INFO L280 TraceCheckUtils]: 17: Hoare triple {2233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2233#false} is VALID [2020-07-17 22:50:55,190 INFO L280 TraceCheckUtils]: 18: Hoare triple {2233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2233#false} is VALID [2020-07-17 22:50:55,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {2233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2233#false} is VALID [2020-07-17 22:50:55,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {2233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2233#false} is VALID [2020-07-17 22:50:55,191 INFO L280 TraceCheckUtils]: 21: Hoare triple {2233#false} assume !(34 == #t~mem9);havoc #t~mem9; {2233#false} is VALID [2020-07-17 22:50:55,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {2233#false} ~j~0 := ~i~0 - 1; {2233#false} is VALID [2020-07-17 22:50:55,191 INFO L280 TraceCheckUtils]: 23: Hoare triple {2233#false} #t~short14 := 0 < ~j~0; {2233#false} is VALID [2020-07-17 22:50:55,192 INFO L280 TraceCheckUtils]: 24: Hoare triple {2233#false} assume !#t~short14; {2233#false} is VALID [2020-07-17 22:50:55,192 INFO L280 TraceCheckUtils]: 25: Hoare triple {2233#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {2233#false} is VALID [2020-07-17 22:50:55,192 INFO L280 TraceCheckUtils]: 26: Hoare triple {2233#false} #t~short17 := 0 < ~j~0; {2233#false} is VALID [2020-07-17 22:50:55,192 INFO L280 TraceCheckUtils]: 27: Hoare triple {2233#false} assume !#t~short17; {2233#false} is VALID [2020-07-17 22:50:55,193 INFO L280 TraceCheckUtils]: 28: Hoare triple {2233#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {2233#false} is VALID [2020-07-17 22:50:55,193 INFO L280 TraceCheckUtils]: 29: Hoare triple {2233#false} assume ~start~0 <= ~j~0; {2233#false} is VALID [2020-07-17 22:50:55,193 INFO L280 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2233#false} is VALID [2020-07-17 22:50:55,193 INFO L263 TraceCheckUtils]: 31: Hoare triple {2233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2232#true} is VALID [2020-07-17 22:50:55,193 INFO L280 TraceCheckUtils]: 32: Hoare triple {2232#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2232#true} is VALID [2020-07-17 22:50:55,194 INFO L280 TraceCheckUtils]: 33: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-17 22:50:55,194 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2232#true} {2233#false} #147#return; {2233#false} is VALID [2020-07-17 22:50:55,194 INFO L280 TraceCheckUtils]: 35: Hoare triple {2233#false} havoc #t~ret19.base, #t~ret19.offset; {2233#false} is VALID [2020-07-17 22:50:55,194 INFO L263 TraceCheckUtils]: 36: Hoare triple {2233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2233#false} is VALID [2020-07-17 22:50:55,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {2233#false} ~cond := #in~cond; {2233#false} is VALID [2020-07-17 22:50:55,195 INFO L280 TraceCheckUtils]: 38: Hoare triple {2233#false} assume 0 == ~cond; {2233#false} is VALID [2020-07-17 22:50:55,195 INFO L280 TraceCheckUtils]: 39: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2020-07-17 22:50:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:55,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219211293] [2020-07-17 22:50:55,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216948970] [2020-07-17 22:50:55,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:55,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:55,328 INFO L263 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2232#true} is VALID [2020-07-17 22:50:55,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {2232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2232#true} is VALID [2020-07-17 22:50:55,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {2232#true} assume true; {2232#true} is VALID [2020-07-17 22:50:55,329 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2232#true} {2232#true} #151#return; {2232#true} is VALID [2020-07-17 22:50:55,329 INFO L263 TraceCheckUtils]: 4: Hoare triple {2232#true} call #t~ret23 := main(); {2232#true} is VALID [2020-07-17 22:50:55,330 INFO L280 TraceCheckUtils]: 5: Hoare triple {2232#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2262#(<= main_~i~1 0)} is VALID [2020-07-17 22:50:55,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {2262#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2262#(<= main_~i~1 0)} is VALID [2020-07-17 22:50:55,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {2262#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2238#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:55,332 INFO L280 TraceCheckUtils]: 8: Hoare triple {2238#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2238#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:55,333 INFO L280 TraceCheckUtils]: 9: Hoare triple {2238#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2239#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:55,335 INFO L280 TraceCheckUtils]: 10: Hoare triple {2239#(<= main_~i~1 2)} assume !(~i~1 < 8); {2233#false} is VALID [2020-07-17 22:50:55,335 INFO L280 TraceCheckUtils]: 11: Hoare triple {2233#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2233#false} is VALID [2020-07-17 22:50:55,335 INFO L263 TraceCheckUtils]: 12: Hoare triple {2233#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2233#false} is VALID [2020-07-17 22:50:55,335 INFO L280 TraceCheckUtils]: 13: Hoare triple {2233#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2233#false} is VALID [2020-07-17 22:50:55,336 INFO L280 TraceCheckUtils]: 14: Hoare triple {2233#false} assume !(~str.base == 0 && ~str.offset == 0); {2233#false} is VALID [2020-07-17 22:50:55,336 INFO L280 TraceCheckUtils]: 15: Hoare triple {2233#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2233#false} is VALID [2020-07-17 22:50:55,336 INFO L280 TraceCheckUtils]: 16: Hoare triple {2233#false} assume #t~switch4; {2233#false} is VALID [2020-07-17 22:50:55,336 INFO L280 TraceCheckUtils]: 17: Hoare triple {2233#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2233#false} is VALID [2020-07-17 22:50:55,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {2233#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2233#false} is VALID [2020-07-17 22:50:55,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {2233#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2233#false} is VALID [2020-07-17 22:50:55,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {2233#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2233#false} is VALID [2020-07-17 22:50:55,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {2233#false} assume !(34 == #t~mem9);havoc #t~mem9; {2233#false} is VALID [2020-07-17 22:50:55,337 INFO L280 TraceCheckUtils]: 22: Hoare triple {2233#false} ~j~0 := ~i~0 - 1; {2233#false} is VALID [2020-07-17 22:50:55,337 INFO L280 TraceCheckUtils]: 23: Hoare triple {2233#false} #t~short14 := 0 < ~j~0; {2233#false} is VALID [2020-07-17 22:50:55,337 INFO L280 TraceCheckUtils]: 24: Hoare triple {2233#false} assume !#t~short14; {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L280 TraceCheckUtils]: 25: Hoare triple {2233#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L280 TraceCheckUtils]: 26: Hoare triple {2233#false} #t~short17 := 0 < ~j~0; {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L280 TraceCheckUtils]: 27: Hoare triple {2233#false} assume !#t~short17; {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L280 TraceCheckUtils]: 28: Hoare triple {2233#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {2233#false} assume ~start~0 <= ~j~0; {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L280 TraceCheckUtils]: 30: Hoare triple {2233#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2233#false} is VALID [2020-07-17 22:50:55,338 INFO L263 TraceCheckUtils]: 31: Hoare triple {2233#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2233#false} is VALID [2020-07-17 22:50:55,339 INFO L280 TraceCheckUtils]: 32: Hoare triple {2233#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2233#false} is VALID [2020-07-17 22:50:55,339 INFO L280 TraceCheckUtils]: 33: Hoare triple {2233#false} assume true; {2233#false} is VALID [2020-07-17 22:50:55,339 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2233#false} {2233#false} #147#return; {2233#false} is VALID [2020-07-17 22:50:55,339 INFO L280 TraceCheckUtils]: 35: Hoare triple {2233#false} havoc #t~ret19.base, #t~ret19.offset; {2233#false} is VALID [2020-07-17 22:50:55,339 INFO L263 TraceCheckUtils]: 36: Hoare triple {2233#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2233#false} is VALID [2020-07-17 22:50:55,340 INFO L280 TraceCheckUtils]: 37: Hoare triple {2233#false} ~cond := #in~cond; {2233#false} is VALID [2020-07-17 22:50:55,340 INFO L280 TraceCheckUtils]: 38: Hoare triple {2233#false} assume 0 == ~cond; {2233#false} is VALID [2020-07-17 22:50:55,340 INFO L280 TraceCheckUtils]: 39: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2020-07-17 22:50:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:55,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:55,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-17 22:50:55,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631452096] [2020-07-17 22:50:55,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-17 22:50:55,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:55,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:55,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:55,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:55,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:55,404 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 7 states. [2020-07-17 22:50:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:55,758 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-07-17 22:50:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:55,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-17 22:50:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-17 22:50:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-17 22:50:55,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-17 22:50:55,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:55,895 INFO L225 Difference]: With dead ends: 116 [2020-07-17 22:50:55,896 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:50:55,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:50:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-07-17 22:50:55,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:55,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2020-07-17 22:50:55,923 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2020-07-17 22:50:55,923 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2020-07-17 22:50:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:55,925 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-07-17 22:50:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-07-17 22:50:55,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:55,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:55,926 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2020-07-17 22:50:55,926 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2020-07-17 22:50:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:55,928 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-07-17 22:50:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-07-17 22:50:55,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:55,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:55,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:55,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 22:50:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-07-17 22:50:55,932 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 40 [2020-07-17 22:50:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:55,932 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-07-17 22:50:55,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2020-07-17 22:50:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:50:55,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:55,933 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:56,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:50:56,144 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 34367350, now seen corresponding path program 2 times [2020-07-17 22:50:56,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:56,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540833756] [2020-07-17 22:50:56,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-17 22:50:56,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-17 22:50:56,267 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-17 22:50:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {2723#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2723#true} is VALID [2020-07-17 22:50:56,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-17 22:50:56,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2723#true} {2724#false} #147#return; {2724#false} is VALID [2020-07-17 22:50:56,276 INFO L263 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:56,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-17 22:50:56,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-17 22:50:56,277 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-17 22:50:56,277 INFO L263 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret23 := main(); {2723#true} is VALID [2020-07-17 22:50:56,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2728#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:56,282 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2728#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:56,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {2728#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2729#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:56,283 INFO L280 TraceCheckUtils]: 8: Hoare triple {2729#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2729#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:56,284 INFO L280 TraceCheckUtils]: 9: Hoare triple {2729#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2730#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:56,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2730#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:56,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {2730#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2731#(<= main_~i~1 3)} is VALID [2020-07-17 22:50:56,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {2731#(<= main_~i~1 3)} assume !(~i~1 < 8); {2724#false} is VALID [2020-07-17 22:50:56,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {2724#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2724#false} is VALID [2020-07-17 22:50:56,287 INFO L263 TraceCheckUtils]: 14: Hoare triple {2724#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2724#false} is VALID [2020-07-17 22:50:56,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {2724#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2724#false} is VALID [2020-07-17 22:50:56,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {2724#false} assume !(~str.base == 0 && ~str.offset == 0); {2724#false} is VALID [2020-07-17 22:50:56,287 INFO L280 TraceCheckUtils]: 17: Hoare triple {2724#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2724#false} is VALID [2020-07-17 22:50:56,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {2724#false} assume #t~switch4; {2724#false} is VALID [2020-07-17 22:50:56,288 INFO L280 TraceCheckUtils]: 19: Hoare triple {2724#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2724#false} is VALID [2020-07-17 22:50:56,288 INFO L280 TraceCheckUtils]: 20: Hoare triple {2724#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2724#false} is VALID [2020-07-17 22:50:56,288 INFO L280 TraceCheckUtils]: 21: Hoare triple {2724#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2724#false} is VALID [2020-07-17 22:50:56,288 INFO L280 TraceCheckUtils]: 22: Hoare triple {2724#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2724#false} is VALID [2020-07-17 22:50:56,289 INFO L280 TraceCheckUtils]: 23: Hoare triple {2724#false} assume !(34 == #t~mem9);havoc #t~mem9; {2724#false} is VALID [2020-07-17 22:50:56,289 INFO L280 TraceCheckUtils]: 24: Hoare triple {2724#false} ~j~0 := ~i~0 - 1; {2724#false} is VALID [2020-07-17 22:50:56,289 INFO L280 TraceCheckUtils]: 25: Hoare triple {2724#false} #t~short14 := 0 < ~j~0; {2724#false} is VALID [2020-07-17 22:50:56,289 INFO L280 TraceCheckUtils]: 26: Hoare triple {2724#false} assume !#t~short14; {2724#false} is VALID [2020-07-17 22:50:56,289 INFO L280 TraceCheckUtils]: 27: Hoare triple {2724#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {2724#false} is VALID [2020-07-17 22:50:56,290 INFO L280 TraceCheckUtils]: 28: Hoare triple {2724#false} #t~short17 := 0 < ~j~0; {2724#false} is VALID [2020-07-17 22:50:56,290 INFO L280 TraceCheckUtils]: 29: Hoare triple {2724#false} assume !#t~short17; {2724#false} is VALID [2020-07-17 22:50:56,290 INFO L280 TraceCheckUtils]: 30: Hoare triple {2724#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {2724#false} is VALID [2020-07-17 22:50:56,290 INFO L280 TraceCheckUtils]: 31: Hoare triple {2724#false} assume ~start~0 <= ~j~0; {2724#false} is VALID [2020-07-17 22:50:56,291 INFO L280 TraceCheckUtils]: 32: Hoare triple {2724#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2724#false} is VALID [2020-07-17 22:50:56,291 INFO L263 TraceCheckUtils]: 33: Hoare triple {2724#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2723#true} is VALID [2020-07-17 22:50:56,291 INFO L280 TraceCheckUtils]: 34: Hoare triple {2723#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2723#true} is VALID [2020-07-17 22:50:56,291 INFO L280 TraceCheckUtils]: 35: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-17 22:50:56,291 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2723#true} {2724#false} #147#return; {2724#false} is VALID [2020-07-17 22:50:56,292 INFO L280 TraceCheckUtils]: 37: Hoare triple {2724#false} havoc #t~ret19.base, #t~ret19.offset; {2724#false} is VALID [2020-07-17 22:50:56,292 INFO L263 TraceCheckUtils]: 38: Hoare triple {2724#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2724#false} is VALID [2020-07-17 22:50:56,292 INFO L280 TraceCheckUtils]: 39: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2020-07-17 22:50:56,292 INFO L280 TraceCheckUtils]: 40: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2020-07-17 22:50:56,292 INFO L280 TraceCheckUtils]: 41: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2020-07-17 22:50:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:56,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540833756] [2020-07-17 22:50:56,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333905577] [2020-07-17 22:50:56,294 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:56,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-17 22:50:56,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:56,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:50:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:56,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:56,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2723#true} is VALID [2020-07-17 22:50:56,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {2723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2723#true} is VALID [2020-07-17 22:50:56,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2020-07-17 22:50:56,504 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #151#return; {2723#true} is VALID [2020-07-17 22:50:56,505 INFO L263 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret23 := main(); {2723#true} is VALID [2020-07-17 22:50:56,505 INFO L280 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2723#true} is VALID [2020-07-17 22:50:56,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-17 22:50:56,505 INFO L280 TraceCheckUtils]: 7: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-17 22:50:56,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-17 22:50:56,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-17 22:50:56,506 INFO L280 TraceCheckUtils]: 10: Hoare triple {2723#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {2723#true} is VALID [2020-07-17 22:50:56,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {2723#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {2723#true} is VALID [2020-07-17 22:50:56,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {2723#true} assume !(~i~1 < 8); {2723#true} is VALID [2020-07-17 22:50:56,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {2723#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2723#true} is VALID [2020-07-17 22:50:56,507 INFO L263 TraceCheckUtils]: 14: Hoare triple {2723#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2723#true} is VALID [2020-07-17 22:50:56,514 INFO L280 TraceCheckUtils]: 15: Hoare triple {2723#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:50:56,515 INFO L280 TraceCheckUtils]: 16: Hoare triple {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2020-07-17 22:50:56,519 INFO L280 TraceCheckUtils]: 17: Hoare triple {2784#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,520 INFO L280 TraceCheckUtils]: 18: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch4; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,521 INFO L280 TraceCheckUtils]: 19: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,522 INFO L280 TraceCheckUtils]: 20: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,522 INFO L280 TraceCheckUtils]: 21: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,523 INFO L280 TraceCheckUtils]: 22: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,523 INFO L280 TraceCheckUtils]: 23: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem9);havoc #t~mem9; {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2020-07-17 22:50:56,524 INFO L280 TraceCheckUtils]: 24: Hoare triple {2791#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,524 INFO L280 TraceCheckUtils]: 25: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short14 := 0 < ~j~0; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,525 INFO L280 TraceCheckUtils]: 26: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,525 INFO L280 TraceCheckUtils]: 27: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,526 INFO L280 TraceCheckUtils]: 28: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short17 := 0 < ~j~0; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,526 INFO L280 TraceCheckUtils]: 29: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,527 INFO L280 TraceCheckUtils]: 30: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2020-07-17 22:50:56,527 INFO L280 TraceCheckUtils]: 31: Hoare triple {2813#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {2724#false} is VALID [2020-07-17 22:50:56,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {2724#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L263 TraceCheckUtils]: 33: Hoare triple {2724#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L280 TraceCheckUtils]: 34: Hoare triple {2724#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L280 TraceCheckUtils]: 35: Hoare triple {2724#false} assume true; {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2724#false} {2724#false} #147#return; {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L280 TraceCheckUtils]: 37: Hoare triple {2724#false} havoc #t~ret19.base, #t~ret19.offset; {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L263 TraceCheckUtils]: 38: Hoare triple {2724#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2724#false} is VALID [2020-07-17 22:50:56,528 INFO L280 TraceCheckUtils]: 39: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2020-07-17 22:50:56,529 INFO L280 TraceCheckUtils]: 40: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2020-07-17 22:50:56,529 INFO L280 TraceCheckUtils]: 41: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2020-07-17 22:50:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-17 22:50:56,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:56,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-07-17 22:50:56,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331559804] [2020-07-17 22:50:56,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-07-17 22:50:56,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:56,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:56,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:56,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:56,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:56,584 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2020-07-17 22:50:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:56,974 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2020-07-17 22:50:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:56,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-07-17 22:50:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2020-07-17 22:50:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2020-07-17 22:50:56,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 143 transitions. [2020-07-17 22:50:57,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:57,145 INFO L225 Difference]: With dead ends: 134 [2020-07-17 22:50:57,146 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 22:50:57,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:50:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 22:50:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-07-17 22:50:57,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:57,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 59 states. [2020-07-17 22:50:57,173 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 59 states. [2020-07-17 22:50:57,173 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 59 states. [2020-07-17 22:50:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:57,176 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-07-17 22:50:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2020-07-17 22:50:57,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:57,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:57,177 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 75 states. [2020-07-17 22:50:57,177 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 75 states. [2020-07-17 22:50:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:57,180 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-07-17 22:50:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2020-07-17 22:50:57,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:57,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:57,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:57,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-17 22:50:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2020-07-17 22:50:57,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 42 [2020-07-17 22:50:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:57,183 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2020-07-17 22:50:57,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-07-17 22:50:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-17 22:50:57,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:57,184 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:57,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:57,399 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:57,400 INFO L82 PathProgramCache]: Analyzing trace with hash -615754617, now seen corresponding path program 1 times [2020-07-17 22:50:57,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:57,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320167253] [2020-07-17 22:50:57,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-17 22:50:57,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-17 22:50:57,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-17 22:50:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {3259#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3259#true} is VALID [2020-07-17 22:50:57,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-17 22:50:57,488 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3259#true} {3260#false} #147#return; {3260#false} is VALID [2020-07-17 22:50:57,488 INFO L263 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:57,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {3271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-17 22:50:57,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-17 22:50:57,489 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-17 22:50:57,489 INFO L263 TraceCheckUtils]: 4: Hoare triple {3259#true} call #t~ret23 := main(); {3259#true} is VALID [2020-07-17 22:50:57,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {3259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3264#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:57,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {3264#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3264#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:57,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {3264#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3265#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:57,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {3265#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3265#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:57,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {3265#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3266#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:57,493 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3266#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:57,494 INFO L280 TraceCheckUtils]: 11: Hoare triple {3266#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3267#(<= main_~i~1 3)} is VALID [2020-07-17 22:50:57,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {3267#(<= main_~i~1 3)} assume !(~i~1 < 8); {3260#false} is VALID [2020-07-17 22:50:57,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3260#false} is VALID [2020-07-17 22:50:57,495 INFO L263 TraceCheckUtils]: 14: Hoare triple {3260#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3260#false} is VALID [2020-07-17 22:50:57,495 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3260#false} is VALID [2020-07-17 22:50:57,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#false} assume !(~str.base == 0 && ~str.offset == 0); {3260#false} is VALID [2020-07-17 22:50:57,495 INFO L280 TraceCheckUtils]: 17: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-17 22:50:57,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {3260#false} assume !#t~switch4; {3260#false} is VALID [2020-07-17 22:50:57,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#false} havoc #t~mem3;havoc #t~switch4; {3260#false} is VALID [2020-07-17 22:50:57,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3260#false} is VALID [2020-07-17 22:50:57,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {3260#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3260#false} is VALID [2020-07-17 22:50:57,497 INFO L280 TraceCheckUtils]: 22: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-17 22:50:57,497 INFO L280 TraceCheckUtils]: 23: Hoare triple {3260#false} assume #t~switch4; {3260#false} is VALID [2020-07-17 22:50:57,497 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3260#false} is VALID [2020-07-17 22:50:57,497 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3260#false} is VALID [2020-07-17 22:50:57,497 INFO L280 TraceCheckUtils]: 26: Hoare triple {3260#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3260#false} is VALID [2020-07-17 22:50:57,498 INFO L280 TraceCheckUtils]: 27: Hoare triple {3260#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3260#false} is VALID [2020-07-17 22:50:57,498 INFO L280 TraceCheckUtils]: 28: Hoare triple {3260#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3260#false} is VALID [2020-07-17 22:50:57,498 INFO L280 TraceCheckUtils]: 29: Hoare triple {3260#false} ~j~0 := ~i~0 - 1; {3260#false} is VALID [2020-07-17 22:50:57,498 INFO L280 TraceCheckUtils]: 30: Hoare triple {3260#false} #t~short14 := 0 < ~j~0; {3260#false} is VALID [2020-07-17 22:50:57,498 INFO L280 TraceCheckUtils]: 31: Hoare triple {3260#false} assume !#t~short14; {3260#false} is VALID [2020-07-17 22:50:57,498 INFO L280 TraceCheckUtils]: 32: Hoare triple {3260#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {3260#false} is VALID [2020-07-17 22:50:57,499 INFO L280 TraceCheckUtils]: 33: Hoare triple {3260#false} #t~short17 := 0 < ~j~0; {3260#false} is VALID [2020-07-17 22:50:57,499 INFO L280 TraceCheckUtils]: 34: Hoare triple {3260#false} assume !#t~short17; {3260#false} is VALID [2020-07-17 22:50:57,499 INFO L280 TraceCheckUtils]: 35: Hoare triple {3260#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {3260#false} is VALID [2020-07-17 22:50:57,499 INFO L280 TraceCheckUtils]: 36: Hoare triple {3260#false} assume ~start~0 <= ~j~0; {3260#false} is VALID [2020-07-17 22:50:57,499 INFO L280 TraceCheckUtils]: 37: Hoare triple {3260#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3260#false} is VALID [2020-07-17 22:50:57,500 INFO L263 TraceCheckUtils]: 38: Hoare triple {3260#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3259#true} is VALID [2020-07-17 22:50:57,500 INFO L280 TraceCheckUtils]: 39: Hoare triple {3259#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3259#true} is VALID [2020-07-17 22:50:57,500 INFO L280 TraceCheckUtils]: 40: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-17 22:50:57,500 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3259#true} {3260#false} #147#return; {3260#false} is VALID [2020-07-17 22:50:57,500 INFO L280 TraceCheckUtils]: 42: Hoare triple {3260#false} havoc #t~ret19.base, #t~ret19.offset; {3260#false} is VALID [2020-07-17 22:50:57,500 INFO L263 TraceCheckUtils]: 43: Hoare triple {3260#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3260#false} is VALID [2020-07-17 22:50:57,501 INFO L280 TraceCheckUtils]: 44: Hoare triple {3260#false} ~cond := #in~cond; {3260#false} is VALID [2020-07-17 22:50:57,501 INFO L280 TraceCheckUtils]: 45: Hoare triple {3260#false} assume 0 == ~cond; {3260#false} is VALID [2020-07-17 22:50:57,501 INFO L280 TraceCheckUtils]: 46: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2020-07-17 22:50:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:50:57,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320167253] [2020-07-17 22:50:57,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637433565] [2020-07-17 22:50:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:50:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:57,658 INFO L263 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3259#true} is VALID [2020-07-17 22:50:57,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {3259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3259#true} is VALID [2020-07-17 22:50:57,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {3259#true} assume true; {3259#true} is VALID [2020-07-17 22:50:57,659 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3259#true} {3259#true} #151#return; {3259#true} is VALID [2020-07-17 22:50:57,659 INFO L263 TraceCheckUtils]: 4: Hoare triple {3259#true} call #t~ret23 := main(); {3259#true} is VALID [2020-07-17 22:50:57,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {3259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3290#(<= main_~i~1 0)} is VALID [2020-07-17 22:50:57,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {3290#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3290#(<= main_~i~1 0)} is VALID [2020-07-17 22:50:57,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {3290#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3265#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:57,661 INFO L280 TraceCheckUtils]: 8: Hoare triple {3265#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3265#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:57,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {3265#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3266#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:57,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3266#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:57,663 INFO L280 TraceCheckUtils]: 11: Hoare triple {3266#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3267#(<= main_~i~1 3)} is VALID [2020-07-17 22:50:57,663 INFO L280 TraceCheckUtils]: 12: Hoare triple {3267#(<= main_~i~1 3)} assume !(~i~1 < 8); {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L263 TraceCheckUtils]: 14: Hoare triple {3260#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#false} assume !(~str.base == 0 && ~str.offset == 0); {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L280 TraceCheckUtils]: 17: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L280 TraceCheckUtils]: 18: Hoare triple {3260#false} assume !#t~switch4; {3260#false} is VALID [2020-07-17 22:50:57,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#false} havoc #t~mem3;havoc #t~switch4; {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 21: Hoare triple {3260#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {3260#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 23: Hoare triple {3260#false} assume #t~switch4; {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3260#false} is VALID [2020-07-17 22:50:57,665 INFO L280 TraceCheckUtils]: 26: Hoare triple {3260#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3260#false} is VALID [2020-07-17 22:50:57,666 INFO L280 TraceCheckUtils]: 27: Hoare triple {3260#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3260#false} is VALID [2020-07-17 22:50:57,666 INFO L280 TraceCheckUtils]: 28: Hoare triple {3260#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3260#false} is VALID [2020-07-17 22:50:57,666 INFO L280 TraceCheckUtils]: 29: Hoare triple {3260#false} ~j~0 := ~i~0 - 1; {3260#false} is VALID [2020-07-17 22:50:57,666 INFO L280 TraceCheckUtils]: 30: Hoare triple {3260#false} #t~short14 := 0 < ~j~0; {3260#false} is VALID [2020-07-17 22:50:57,666 INFO L280 TraceCheckUtils]: 31: Hoare triple {3260#false} assume !#t~short14; {3260#false} is VALID [2020-07-17 22:50:57,666 INFO L280 TraceCheckUtils]: 32: Hoare triple {3260#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L280 TraceCheckUtils]: 33: Hoare triple {3260#false} #t~short17 := 0 < ~j~0; {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L280 TraceCheckUtils]: 34: Hoare triple {3260#false} assume !#t~short17; {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L280 TraceCheckUtils]: 35: Hoare triple {3260#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L280 TraceCheckUtils]: 36: Hoare triple {3260#false} assume ~start~0 <= ~j~0; {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L280 TraceCheckUtils]: 37: Hoare triple {3260#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L263 TraceCheckUtils]: 38: Hoare triple {3260#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3260#false} is VALID [2020-07-17 22:50:57,667 INFO L280 TraceCheckUtils]: 39: Hoare triple {3260#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3260#false} is VALID [2020-07-17 22:50:57,668 INFO L280 TraceCheckUtils]: 40: Hoare triple {3260#false} assume true; {3260#false} is VALID [2020-07-17 22:50:57,668 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3260#false} {3260#false} #147#return; {3260#false} is VALID [2020-07-17 22:50:57,668 INFO L280 TraceCheckUtils]: 42: Hoare triple {3260#false} havoc #t~ret19.base, #t~ret19.offset; {3260#false} is VALID [2020-07-17 22:50:57,668 INFO L263 TraceCheckUtils]: 43: Hoare triple {3260#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3260#false} is VALID [2020-07-17 22:50:57,668 INFO L280 TraceCheckUtils]: 44: Hoare triple {3260#false} ~cond := #in~cond; {3260#false} is VALID [2020-07-17 22:50:57,668 INFO L280 TraceCheckUtils]: 45: Hoare triple {3260#false} assume 0 == ~cond; {3260#false} is VALID [2020-07-17 22:50:57,669 INFO L280 TraceCheckUtils]: 46: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2020-07-17 22:50:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:50:57,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:57,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-17 22:50:57,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271265983] [2020-07-17 22:50:57,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-17 22:50:57,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:57,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:57,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:57,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:57,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:57,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:57,733 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 8 states. [2020-07-17 22:50:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,133 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2020-07-17 22:50:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:58,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-17 22:50:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-17 22:50:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-17 22:50:58,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-17 22:50:58,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:58,278 INFO L225 Difference]: With dead ends: 108 [2020-07-17 22:50:58,278 INFO L226 Difference]: Without dead ends: 62 [2020-07-17 22:50:58,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-17 22:50:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-07-17 22:50:58,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:58,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2020-07-17 22:50:58,305 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2020-07-17 22:50:58,305 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2020-07-17 22:50:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,308 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-17 22:50:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-17 22:50:58,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,309 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2020-07-17 22:50:58,309 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2020-07-17 22:50:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,311 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-17 22:50:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-17 22:50:58,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:58,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 22:50:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2020-07-17 22:50:58,314 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 47 [2020-07-17 22:50:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:58,315 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2020-07-17 22:50:58,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2020-07-17 22:50:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 22:50:58,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:58,316 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:58,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:58,525 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash -900340667, now seen corresponding path program 2 times [2020-07-17 22:50:58,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:58,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453843411] [2020-07-17 22:50:58,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-17 22:50:58,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-17 22:50:58,641 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-17 22:50:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {3754#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3754#true} is VALID [2020-07-17 22:50:58,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-17 22:50:58,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3754#true} {3755#false} #147#return; {3755#false} is VALID [2020-07-17 22:50:58,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:58,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {3767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-17 22:50:58,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-17 22:50:58,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-17 22:50:58,650 INFO L263 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret23 := main(); {3754#true} is VALID [2020-07-17 22:50:58,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {3754#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3759#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:58,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {3759#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3759#(= 0 main_~i~1)} is VALID [2020-07-17 22:50:58,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {3759#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3760#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:58,653 INFO L280 TraceCheckUtils]: 8: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3760#(<= main_~i~1 1)} is VALID [2020-07-17 22:50:58,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3761#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:58,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3761#(<= main_~i~1 2)} is VALID [2020-07-17 22:50:58,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {3761#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3762#(<= main_~i~1 3)} is VALID [2020-07-17 22:50:58,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3762#(<= main_~i~1 3)} is VALID [2020-07-17 22:50:58,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {3762#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3763#(<= main_~i~1 4)} is VALID [2020-07-17 22:50:58,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~i~1 4)} assume !(~i~1 < 8); {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 15: Hoare triple {3755#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L263 TraceCheckUtils]: 16: Hoare triple {3755#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {3755#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 18: Hoare triple {3755#false} assume !(~str.base == 0 && ~str.offset == 0); {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {3755#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 20: Hoare triple {3755#false} assume !#t~switch4; {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 21: Hoare triple {3755#false} havoc #t~mem3;havoc #t~switch4; {3755#false} is VALID [2020-07-17 22:50:58,660 INFO L280 TraceCheckUtils]: 22: Hoare triple {3755#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 23: Hoare triple {3755#false} assume !!(0 != #t~mem1);havoc #t~mem1; {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 24: Hoare triple {3755#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 25: Hoare triple {3755#false} assume #t~switch4; {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 26: Hoare triple {3755#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 27: Hoare triple {3755#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 28: Hoare triple {3755#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3755#false} is VALID [2020-07-17 22:50:58,661 INFO L280 TraceCheckUtils]: 29: Hoare triple {3755#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 30: Hoare triple {3755#false} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 31: Hoare triple {3755#false} ~j~0 := ~i~0 - 1; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 32: Hoare triple {3755#false} #t~short14 := 0 < ~j~0; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 33: Hoare triple {3755#false} assume !#t~short14; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 34: Hoare triple {3755#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 35: Hoare triple {3755#false} #t~short17 := 0 < ~j~0; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 36: Hoare triple {3755#false} assume !#t~short17; {3755#false} is VALID [2020-07-17 22:50:58,662 INFO L280 TraceCheckUtils]: 37: Hoare triple {3755#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {3755#false} is VALID [2020-07-17 22:50:58,663 INFO L280 TraceCheckUtils]: 38: Hoare triple {3755#false} assume ~start~0 <= ~j~0; {3755#false} is VALID [2020-07-17 22:50:58,663 INFO L280 TraceCheckUtils]: 39: Hoare triple {3755#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3755#false} is VALID [2020-07-17 22:50:58,663 INFO L263 TraceCheckUtils]: 40: Hoare triple {3755#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3754#true} is VALID [2020-07-17 22:50:58,663 INFO L280 TraceCheckUtils]: 41: Hoare triple {3754#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3754#true} is VALID [2020-07-17 22:50:58,663 INFO L280 TraceCheckUtils]: 42: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-17 22:50:58,663 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3754#true} {3755#false} #147#return; {3755#false} is VALID [2020-07-17 22:50:58,663 INFO L280 TraceCheckUtils]: 44: Hoare triple {3755#false} havoc #t~ret19.base, #t~ret19.offset; {3755#false} is VALID [2020-07-17 22:50:58,663 INFO L263 TraceCheckUtils]: 45: Hoare triple {3755#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3755#false} is VALID [2020-07-17 22:50:58,664 INFO L280 TraceCheckUtils]: 46: Hoare triple {3755#false} ~cond := #in~cond; {3755#false} is VALID [2020-07-17 22:50:58,664 INFO L280 TraceCheckUtils]: 47: Hoare triple {3755#false} assume 0 == ~cond; {3755#false} is VALID [2020-07-17 22:50:58,664 INFO L280 TraceCheckUtils]: 48: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2020-07-17 22:50:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:50:58,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453843411] [2020-07-17 22:50:58,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859649406] [2020-07-17 22:50:58,667 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:58,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-17 22:50:58,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:58,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:50:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:58,822 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:58,861 INFO L263 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3754#true} is VALID [2020-07-17 22:50:58,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {3754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3754#true} is VALID [2020-07-17 22:50:58,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2020-07-17 22:50:58,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #151#return; {3754#true} is VALID [2020-07-17 22:50:58,861 INFO L263 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret23 := main(); {3754#true} is VALID [2020-07-17 22:50:58,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {3754#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 8: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 9: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 10: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 11: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-17 22:50:58,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {3754#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {3754#true} is VALID [2020-07-17 22:50:58,863 INFO L280 TraceCheckUtils]: 13: Hoare triple {3754#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {3754#true} is VALID [2020-07-17 22:50:58,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {3754#true} assume !(~i~1 < 8); {3754#true} is VALID [2020-07-17 22:50:58,863 INFO L280 TraceCheckUtils]: 15: Hoare triple {3754#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3754#true} is VALID [2020-07-17 22:50:58,863 INFO L263 TraceCheckUtils]: 16: Hoare triple {3754#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3754#true} is VALID [2020-07-17 22:50:58,864 INFO L280 TraceCheckUtils]: 17: Hoare triple {3754#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,864 INFO L280 TraceCheckUtils]: 18: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,864 INFO L280 TraceCheckUtils]: 19: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,865 INFO L280 TraceCheckUtils]: 20: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,865 INFO L280 TraceCheckUtils]: 21: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} havoc #t~mem3;havoc #t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,865 INFO L280 TraceCheckUtils]: 22: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,866 INFO L280 TraceCheckUtils]: 23: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem1);havoc #t~mem1; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,866 INFO L280 TraceCheckUtils]: 24: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,866 INFO L280 TraceCheckUtils]: 25: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume #t~switch4; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,867 INFO L280 TraceCheckUtils]: 26: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,867 INFO L280 TraceCheckUtils]: 27: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,867 INFO L280 TraceCheckUtils]: 28: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,868 INFO L280 TraceCheckUtils]: 29: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {3822#(<= 0 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,869 INFO L280 TraceCheckUtils]: 30: Hoare triple {3822#(<= 0 parse_expression_list_~start~0)} assume 34 == #t~mem9;havoc #t~mem9;#t~post10 := ~start~0;~start~0 := 1 + #t~post10;havoc #t~post10; {3862#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,869 INFO L280 TraceCheckUtils]: 31: Hoare triple {3862#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {3862#(<= 1 parse_expression_list_~start~0)} is VALID [2020-07-17 22:50:58,874 INFO L280 TraceCheckUtils]: 32: Hoare triple {3862#(<= 1 parse_expression_list_~start~0)} #t~short14 := 0 < ~j~0; {3869#(and (<= 1 parse_expression_list_~start~0) (or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|)))} is VALID [2020-07-17 22:50:58,875 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#(and (<= 1 parse_expression_list_~start~0) (or (and (<= parse_expression_list_~j~0 0) (not |parse_expression_list_#t~short14|)) (and (< 0 parse_expression_list_~j~0) |parse_expression_list_#t~short14|)))} assume !#t~short14; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:58,876 INFO L280 TraceCheckUtils]: 34: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:58,876 INFO L280 TraceCheckUtils]: 35: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short17 := 0 < ~j~0; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:58,876 INFO L280 TraceCheckUtils]: 36: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:58,877 INFO L280 TraceCheckUtils]: 37: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2020-07-17 22:50:58,878 INFO L280 TraceCheckUtils]: 38: Hoare triple {3873#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {3755#false} is VALID [2020-07-17 22:50:58,878 INFO L280 TraceCheckUtils]: 39: Hoare triple {3755#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3755#false} is VALID [2020-07-17 22:50:58,878 INFO L263 TraceCheckUtils]: 40: Hoare triple {3755#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3755#false} is VALID [2020-07-17 22:50:58,878 INFO L280 TraceCheckUtils]: 41: Hoare triple {3755#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {3755#false} is VALID [2020-07-17 22:50:58,878 INFO L280 TraceCheckUtils]: 42: Hoare triple {3755#false} assume true; {3755#false} is VALID [2020-07-17 22:50:58,879 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3755#false} {3755#false} #147#return; {3755#false} is VALID [2020-07-17 22:50:58,879 INFO L280 TraceCheckUtils]: 44: Hoare triple {3755#false} havoc #t~ret19.base, #t~ret19.offset; {3755#false} is VALID [2020-07-17 22:50:58,879 INFO L263 TraceCheckUtils]: 45: Hoare triple {3755#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3755#false} is VALID [2020-07-17 22:50:58,879 INFO L280 TraceCheckUtils]: 46: Hoare triple {3755#false} ~cond := #in~cond; {3755#false} is VALID [2020-07-17 22:50:58,879 INFO L280 TraceCheckUtils]: 47: Hoare triple {3755#false} assume 0 == ~cond; {3755#false} is VALID [2020-07-17 22:50:58,879 INFO L280 TraceCheckUtils]: 48: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2020-07-17 22:50:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-17 22:50:58,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:58,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2020-07-17 22:50:58,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876485281] [2020-07-17 22:50:58,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-17 22:50:58,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:58,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:58,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:58,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:58,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:58,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:50:58,936 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2020-07-17 22:50:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,367 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2020-07-17 22:50:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:59,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-17 22:50:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2020-07-17 22:50:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2020-07-17 22:50:59,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 174 transitions. [2020-07-17 22:50:59,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:59,579 INFO L225 Difference]: With dead ends: 160 [2020-07-17 22:50:59,579 INFO L226 Difference]: Without dead ends: 115 [2020-07-17 22:50:59,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:50:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-17 22:50:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2020-07-17 22:50:59,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:59,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 83 states. [2020-07-17 22:50:59,618 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 83 states. [2020-07-17 22:50:59,618 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 83 states. [2020-07-17 22:50:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,622 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2020-07-17 22:50:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2020-07-17 22:50:59,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:59,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:59,623 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 115 states. [2020-07-17 22:50:59,623 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 115 states. [2020-07-17 22:50:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,627 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2020-07-17 22:50:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2020-07-17 22:50:59,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:59,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:59,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:59,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-17 22:50:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2020-07-17 22:50:59,631 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 49 [2020-07-17 22:50:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:59,631 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2020-07-17 22:50:59,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2020-07-17 22:50:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 22:50:59,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:59,633 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:59,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-17 22:50:59,848 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:59,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1705682887, now seen corresponding path program 1 times [2020-07-17 22:50:59,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:59,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324707261] [2020-07-17 22:50:59,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:59,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-17 22:50:59,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-17 22:50:59,978 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-17 22:50:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {4451#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4451#true} is VALID [2020-07-17 22:51:00,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-17 22:51:00,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4452#false} #147#return; {4452#false} is VALID [2020-07-17 22:51:00,006 INFO L263 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:00,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {4464#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-17 22:51:00,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-17 22:51:00,007 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-17 22:51:00,007 INFO L263 TraceCheckUtils]: 4: Hoare triple {4451#true} call #t~ret23 := main(); {4451#true} is VALID [2020-07-17 22:51:00,008 INFO L280 TraceCheckUtils]: 5: Hoare triple {4451#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {4456#(= 0 main_~i~1)} is VALID [2020-07-17 22:51:00,008 INFO L280 TraceCheckUtils]: 6: Hoare triple {4456#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4456#(= 0 main_~i~1)} is VALID [2020-07-17 22:51:00,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {4456#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4457#(<= main_~i~1 1)} is VALID [2020-07-17 22:51:00,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {4457#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4457#(<= main_~i~1 1)} is VALID [2020-07-17 22:51:00,010 INFO L280 TraceCheckUtils]: 9: Hoare triple {4457#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4458#(<= main_~i~1 2)} is VALID [2020-07-17 22:51:00,011 INFO L280 TraceCheckUtils]: 10: Hoare triple {4458#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4458#(<= main_~i~1 2)} is VALID [2020-07-17 22:51:00,012 INFO L280 TraceCheckUtils]: 11: Hoare triple {4458#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4459#(<= main_~i~1 3)} is VALID [2020-07-17 22:51:00,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {4459#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4459#(<= main_~i~1 3)} is VALID [2020-07-17 22:51:00,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {4459#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4460#(<= main_~i~1 4)} is VALID [2020-07-17 22:51:00,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {4460#(<= main_~i~1 4)} assume !(~i~1 < 8); {4452#false} is VALID [2020-07-17 22:51:00,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {4452#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4452#false} is VALID [2020-07-17 22:51:00,014 INFO L263 TraceCheckUtils]: 16: Hoare triple {4452#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4452#false} is VALID [2020-07-17 22:51:00,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {4452#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {4452#false} is VALID [2020-07-17 22:51:00,015 INFO L280 TraceCheckUtils]: 18: Hoare triple {4452#false} assume !(~str.base == 0 && ~str.offset == 0); {4452#false} is VALID [2020-07-17 22:51:00,015 INFO L280 TraceCheckUtils]: 19: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-17 22:51:00,015 INFO L280 TraceCheckUtils]: 20: Hoare triple {4452#false} assume !#t~switch4; {4452#false} is VALID [2020-07-17 22:51:00,015 INFO L280 TraceCheckUtils]: 21: Hoare triple {4452#false} havoc #t~mem3;havoc #t~switch4; {4452#false} is VALID [2020-07-17 22:51:00,015 INFO L280 TraceCheckUtils]: 22: Hoare triple {4452#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4452#false} is VALID [2020-07-17 22:51:00,016 INFO L280 TraceCheckUtils]: 23: Hoare triple {4452#false} assume !!(0 != #t~mem1);havoc #t~mem1; {4452#false} is VALID [2020-07-17 22:51:00,016 INFO L280 TraceCheckUtils]: 24: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-17 22:51:00,016 INFO L280 TraceCheckUtils]: 25: Hoare triple {4452#false} assume #t~switch4; {4452#false} is VALID [2020-07-17 22:51:00,016 INFO L280 TraceCheckUtils]: 26: Hoare triple {4452#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4452#false} is VALID [2020-07-17 22:51:00,016 INFO L280 TraceCheckUtils]: 27: Hoare triple {4452#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4452#false} is VALID [2020-07-17 22:51:00,017 INFO L280 TraceCheckUtils]: 28: Hoare triple {4452#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {4452#false} is VALID [2020-07-17 22:51:00,017 INFO L280 TraceCheckUtils]: 29: Hoare triple {4452#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4452#false} is VALID [2020-07-17 22:51:00,017 INFO L280 TraceCheckUtils]: 30: Hoare triple {4452#false} assume !(34 == #t~mem9);havoc #t~mem9; {4452#false} is VALID [2020-07-17 22:51:00,017 INFO L280 TraceCheckUtils]: 31: Hoare triple {4452#false} ~j~0 := ~i~0 - 1; {4452#false} is VALID [2020-07-17 22:51:00,017 INFO L280 TraceCheckUtils]: 32: Hoare triple {4452#false} #t~short14 := 0 < ~j~0; {4452#false} is VALID [2020-07-17 22:51:00,018 INFO L280 TraceCheckUtils]: 33: Hoare triple {4452#false} assume !#t~short14; {4452#false} is VALID [2020-07-17 22:51:00,018 INFO L280 TraceCheckUtils]: 34: Hoare triple {4452#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {4452#false} is VALID [2020-07-17 22:51:00,018 INFO L280 TraceCheckUtils]: 35: Hoare triple {4452#false} #t~short17 := 0 < ~j~0; {4452#false} is VALID [2020-07-17 22:51:00,018 INFO L280 TraceCheckUtils]: 36: Hoare triple {4452#false} assume !#t~short17; {4452#false} is VALID [2020-07-17 22:51:00,018 INFO L280 TraceCheckUtils]: 37: Hoare triple {4452#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {4452#false} is VALID [2020-07-17 22:51:00,018 INFO L280 TraceCheckUtils]: 38: Hoare triple {4452#false} assume ~start~0 <= ~j~0; {4452#false} is VALID [2020-07-17 22:51:00,019 INFO L280 TraceCheckUtils]: 39: Hoare triple {4452#false} assume !(1 + (~j~0 - ~start~0) >= 2); {4452#false} is VALID [2020-07-17 22:51:00,019 INFO L263 TraceCheckUtils]: 40: Hoare triple {4452#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {4451#true} is VALID [2020-07-17 22:51:00,019 INFO L280 TraceCheckUtils]: 41: Hoare triple {4451#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4451#true} is VALID [2020-07-17 22:51:00,019 INFO L280 TraceCheckUtils]: 42: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-17 22:51:00,019 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4451#true} {4452#false} #147#return; {4452#false} is VALID [2020-07-17 22:51:00,020 INFO L280 TraceCheckUtils]: 44: Hoare triple {4452#false} havoc #t~ret19.base, #t~ret19.offset; {4452#false} is VALID [2020-07-17 22:51:00,020 INFO L263 TraceCheckUtils]: 45: Hoare triple {4452#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4452#false} is VALID [2020-07-17 22:51:00,020 INFO L280 TraceCheckUtils]: 46: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2020-07-17 22:51:00,020 INFO L280 TraceCheckUtils]: 47: Hoare triple {4452#false} assume 0 == ~cond; {4452#false} is VALID [2020-07-17 22:51:00,020 INFO L280 TraceCheckUtils]: 48: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2020-07-17 22:51:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:51:00,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324707261] [2020-07-17 22:51:00,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122386028] [2020-07-17 22:51:00,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:51:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:00,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4451#true} is VALID [2020-07-17 22:51:00,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {4451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4451#true} is VALID [2020-07-17 22:51:00,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {4451#true} assume true; {4451#true} is VALID [2020-07-17 22:51:00,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4451#true} {4451#true} #151#return; {4451#true} is VALID [2020-07-17 22:51:00,192 INFO L263 TraceCheckUtils]: 4: Hoare triple {4451#true} call #t~ret23 := main(); {4451#true} is VALID [2020-07-17 22:51:00,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {4451#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {4483#(<= main_~i~1 0)} is VALID [2020-07-17 22:51:00,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {4483#(<= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4483#(<= main_~i~1 0)} is VALID [2020-07-17 22:51:00,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {4483#(<= main_~i~1 0)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4457#(<= main_~i~1 1)} is VALID [2020-07-17 22:51:00,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {4457#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4457#(<= main_~i~1 1)} is VALID [2020-07-17 22:51:00,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {4457#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4458#(<= main_~i~1 2)} is VALID [2020-07-17 22:51:00,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {4458#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4458#(<= main_~i~1 2)} is VALID [2020-07-17 22:51:00,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {4458#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4459#(<= main_~i~1 3)} is VALID [2020-07-17 22:51:00,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {4459#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {4459#(<= main_~i~1 3)} is VALID [2020-07-17 22:51:00,196 INFO L280 TraceCheckUtils]: 13: Hoare triple {4459#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {4460#(<= main_~i~1 4)} is VALID [2020-07-17 22:51:00,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {4460#(<= main_~i~1 4)} assume !(~i~1 < 8); {4452#false} is VALID [2020-07-17 22:51:00,196 INFO L280 TraceCheckUtils]: 15: Hoare triple {4452#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L263 TraceCheckUtils]: 16: Hoare triple {4452#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 17: Hoare triple {4452#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 18: Hoare triple {4452#false} assume !(~str.base == 0 && ~str.offset == 0); {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 19: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 20: Hoare triple {4452#false} assume !#t~switch4; {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 21: Hoare triple {4452#false} havoc #t~mem3;havoc #t~switch4; {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 22: Hoare triple {4452#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {4452#false} is VALID [2020-07-17 22:51:00,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {4452#false} assume !!(0 != #t~mem1);havoc #t~mem1; {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 24: Hoare triple {4452#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 25: Hoare triple {4452#false} assume #t~switch4; {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 26: Hoare triple {4452#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 27: Hoare triple {4452#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 28: Hoare triple {4452#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 29: Hoare triple {4452#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {4452#false} is VALID [2020-07-17 22:51:00,198 INFO L280 TraceCheckUtils]: 30: Hoare triple {4452#false} assume !(34 == #t~mem9);havoc #t~mem9; {4452#false} is VALID [2020-07-17 22:51:00,199 INFO L280 TraceCheckUtils]: 31: Hoare triple {4452#false} ~j~0 := ~i~0 - 1; {4452#false} is VALID [2020-07-17 22:51:00,199 INFO L280 TraceCheckUtils]: 32: Hoare triple {4452#false} #t~short14 := 0 < ~j~0; {4452#false} is VALID [2020-07-17 22:51:00,199 INFO L280 TraceCheckUtils]: 33: Hoare triple {4452#false} assume !#t~short14; {4452#false} is VALID [2020-07-17 22:51:00,199 INFO L280 TraceCheckUtils]: 34: Hoare triple {4452#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {4452#false} is VALID [2020-07-17 22:51:00,199 INFO L280 TraceCheckUtils]: 35: Hoare triple {4452#false} #t~short17 := 0 < ~j~0; {4452#false} is VALID [2020-07-17 22:51:00,199 INFO L280 TraceCheckUtils]: 36: Hoare triple {4452#false} assume !#t~short17; {4452#false} is VALID [2020-07-17 22:51:00,200 INFO L280 TraceCheckUtils]: 37: Hoare triple {4452#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {4452#false} is VALID [2020-07-17 22:51:00,200 INFO L280 TraceCheckUtils]: 38: Hoare triple {4452#false} assume ~start~0 <= ~j~0; {4452#false} is VALID [2020-07-17 22:51:00,200 INFO L280 TraceCheckUtils]: 39: Hoare triple {4452#false} assume !(1 + (~j~0 - ~start~0) >= 2); {4452#false} is VALID [2020-07-17 22:51:00,200 INFO L263 TraceCheckUtils]: 40: Hoare triple {4452#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {4452#false} is VALID [2020-07-17 22:51:00,200 INFO L280 TraceCheckUtils]: 41: Hoare triple {4452#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {4452#false} is VALID [2020-07-17 22:51:00,200 INFO L280 TraceCheckUtils]: 42: Hoare triple {4452#false} assume true; {4452#false} is VALID [2020-07-17 22:51:00,201 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4452#false} {4452#false} #147#return; {4452#false} is VALID [2020-07-17 22:51:00,201 INFO L280 TraceCheckUtils]: 44: Hoare triple {4452#false} havoc #t~ret19.base, #t~ret19.offset; {4452#false} is VALID [2020-07-17 22:51:00,201 INFO L263 TraceCheckUtils]: 45: Hoare triple {4452#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {4452#false} is VALID [2020-07-17 22:51:00,201 INFO L280 TraceCheckUtils]: 46: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2020-07-17 22:51:00,201 INFO L280 TraceCheckUtils]: 47: Hoare triple {4452#false} assume 0 == ~cond; {4452#false} is VALID [2020-07-17 22:51:00,202 INFO L280 TraceCheckUtils]: 48: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2020-07-17 22:51:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:51:00,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:00,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-17 22:51:00,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660862303] [2020-07-17 22:51:00,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-17 22:51:00,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:00,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:51:00,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:51:00,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:51:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:51:00,257 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 9 states. [2020-07-17 22:51:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,672 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2020-07-17 22:51:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:00,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-17 22:51:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:51:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2020-07-17 22:51:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:51:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2020-07-17 22:51:00,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2020-07-17 22:51:00,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:00,800 INFO L225 Difference]: With dead ends: 154 [2020-07-17 22:51:00,800 INFO L226 Difference]: Without dead ends: 86 [2020-07-17 22:51:00,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:51:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-17 22:51:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-17 22:51:00,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:00,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-17 22:51:00,824 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-17 22:51:00,824 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-17 22:51:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,826 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-17 22:51:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2020-07-17 22:51:00,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:00,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:00,827 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-17 22:51:00,827 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-17 22:51:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,829 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-17 22:51:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2020-07-17 22:51:00,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:00,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:00,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:00,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 22:51:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-07-17 22:51:00,832 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 49 [2020-07-17 22:51:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:00,832 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-07-17 22:51:00,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:51:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-07-17 22:51:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 22:51:00,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:00,833 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:01,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:01,047 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1198571515, now seen corresponding path program 2 times [2020-07-17 22:51:01,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:01,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690155497] [2020-07-17 22:51:01,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-17 22:51:01,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-17 22:51:01,169 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-17 22:51:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {5085#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-17 22:51:01,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-17 22:51:01,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5085#true} {5086#false} #147#return; {5086#false} is VALID [2020-07-17 22:51:01,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {5085#true} call ULTIMATE.init(); {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:01,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {5099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-17 22:51:01,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-17 22:51:01,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-17 22:51:01,176 INFO L263 TraceCheckUtils]: 4: Hoare triple {5085#true} call #t~ret23 := main(); {5085#true} is VALID [2020-07-17 22:51:01,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {5085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {5090#(= 0 main_~i~1)} is VALID [2020-07-17 22:51:01,177 INFO L280 TraceCheckUtils]: 6: Hoare triple {5090#(= 0 main_~i~1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5090#(= 0 main_~i~1)} is VALID [2020-07-17 22:51:01,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {5090#(= 0 main_~i~1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5091#(<= main_~i~1 1)} is VALID [2020-07-17 22:51:01,179 INFO L280 TraceCheckUtils]: 8: Hoare triple {5091#(<= main_~i~1 1)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5091#(<= main_~i~1 1)} is VALID [2020-07-17 22:51:01,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {5091#(<= main_~i~1 1)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5092#(<= main_~i~1 2)} is VALID [2020-07-17 22:51:01,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {5092#(<= main_~i~1 2)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5092#(<= main_~i~1 2)} is VALID [2020-07-17 22:51:01,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {5092#(<= main_~i~1 2)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5093#(<= main_~i~1 3)} is VALID [2020-07-17 22:51:01,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {5093#(<= main_~i~1 3)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5093#(<= main_~i~1 3)} is VALID [2020-07-17 22:51:01,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {5093#(<= main_~i~1 3)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5094#(<= main_~i~1 4)} is VALID [2020-07-17 22:51:01,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {5094#(<= main_~i~1 4)} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5094#(<= main_~i~1 4)} is VALID [2020-07-17 22:51:01,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {5094#(<= main_~i~1 4)} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5095#(<= main_~i~1 5)} is VALID [2020-07-17 22:51:01,185 INFO L280 TraceCheckUtils]: 16: Hoare triple {5095#(<= main_~i~1 5)} assume !(~i~1 < 8); {5086#false} is VALID [2020-07-17 22:51:01,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {5086#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5086#false} is VALID [2020-07-17 22:51:01,185 INFO L263 TraceCheckUtils]: 18: Hoare triple {5086#false} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5086#false} is VALID [2020-07-17 22:51:01,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {5086#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {5086#false} is VALID [2020-07-17 22:51:01,185 INFO L280 TraceCheckUtils]: 20: Hoare triple {5086#false} assume !(~str.base == 0 && ~str.offset == 0); {5086#false} is VALID [2020-07-17 22:51:01,186 INFO L280 TraceCheckUtils]: 21: Hoare triple {5086#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5086#false} is VALID [2020-07-17 22:51:01,186 INFO L280 TraceCheckUtils]: 22: Hoare triple {5086#false} assume !#t~switch4; {5086#false} is VALID [2020-07-17 22:51:01,186 INFO L280 TraceCheckUtils]: 23: Hoare triple {5086#false} havoc #t~mem3;havoc #t~switch4; {5086#false} is VALID [2020-07-17 22:51:01,186 INFO L280 TraceCheckUtils]: 24: Hoare triple {5086#false} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5086#false} is VALID [2020-07-17 22:51:01,186 INFO L280 TraceCheckUtils]: 25: Hoare triple {5086#false} assume !!(0 != #t~mem1);havoc #t~mem1; {5086#false} is VALID [2020-07-17 22:51:01,186 INFO L280 TraceCheckUtils]: 26: Hoare triple {5086#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5086#false} is VALID [2020-07-17 22:51:01,187 INFO L280 TraceCheckUtils]: 27: Hoare triple {5086#false} assume #t~switch4; {5086#false} is VALID [2020-07-17 22:51:01,187 INFO L280 TraceCheckUtils]: 28: Hoare triple {5086#false} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5086#false} is VALID [2020-07-17 22:51:01,187 INFO L280 TraceCheckUtils]: 29: Hoare triple {5086#false} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5086#false} is VALID [2020-07-17 22:51:01,187 INFO L280 TraceCheckUtils]: 30: Hoare triple {5086#false} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {5086#false} is VALID [2020-07-17 22:51:01,187 INFO L280 TraceCheckUtils]: 31: Hoare triple {5086#false} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5086#false} is VALID [2020-07-17 22:51:01,188 INFO L280 TraceCheckUtils]: 32: Hoare triple {5086#false} assume !(34 == #t~mem9);havoc #t~mem9; {5086#false} is VALID [2020-07-17 22:51:01,188 INFO L280 TraceCheckUtils]: 33: Hoare triple {5086#false} ~j~0 := ~i~0 - 1; {5086#false} is VALID [2020-07-17 22:51:01,188 INFO L280 TraceCheckUtils]: 34: Hoare triple {5086#false} #t~short14 := 0 < ~j~0; {5086#false} is VALID [2020-07-17 22:51:01,188 INFO L280 TraceCheckUtils]: 35: Hoare triple {5086#false} assume !#t~short14; {5086#false} is VALID [2020-07-17 22:51:01,188 INFO L280 TraceCheckUtils]: 36: Hoare triple {5086#false} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {5086#false} is VALID [2020-07-17 22:51:01,188 INFO L280 TraceCheckUtils]: 37: Hoare triple {5086#false} #t~short17 := 0 < ~j~0; {5086#false} is VALID [2020-07-17 22:51:01,189 INFO L280 TraceCheckUtils]: 38: Hoare triple {5086#false} assume !#t~short17; {5086#false} is VALID [2020-07-17 22:51:01,189 INFO L280 TraceCheckUtils]: 39: Hoare triple {5086#false} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {5086#false} is VALID [2020-07-17 22:51:01,189 INFO L280 TraceCheckUtils]: 40: Hoare triple {5086#false} assume ~start~0 <= ~j~0; {5086#false} is VALID [2020-07-17 22:51:01,189 INFO L280 TraceCheckUtils]: 41: Hoare triple {5086#false} assume !(1 + (~j~0 - ~start~0) >= 2); {5086#false} is VALID [2020-07-17 22:51:01,189 INFO L263 TraceCheckUtils]: 42: Hoare triple {5086#false} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {5085#true} is VALID [2020-07-17 22:51:01,190 INFO L280 TraceCheckUtils]: 43: Hoare triple {5085#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-17 22:51:01,190 INFO L280 TraceCheckUtils]: 44: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-17 22:51:01,190 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5085#true} {5086#false} #147#return; {5086#false} is VALID [2020-07-17 22:51:01,190 INFO L280 TraceCheckUtils]: 46: Hoare triple {5086#false} havoc #t~ret19.base, #t~ret19.offset; {5086#false} is VALID [2020-07-17 22:51:01,190 INFO L263 TraceCheckUtils]: 47: Hoare triple {5086#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5086#false} is VALID [2020-07-17 22:51:01,190 INFO L280 TraceCheckUtils]: 48: Hoare triple {5086#false} ~cond := #in~cond; {5086#false} is VALID [2020-07-17 22:51:01,191 INFO L280 TraceCheckUtils]: 49: Hoare triple {5086#false} assume 0 == ~cond; {5086#false} is VALID [2020-07-17 22:51:01,191 INFO L280 TraceCheckUtils]: 50: Hoare triple {5086#false} assume !false; {5086#false} is VALID [2020-07-17 22:51:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:51:01,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690155497] [2020-07-17 22:51:01,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818433435] [2020-07-17 22:51:01,193 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:01,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-17 22:51:01,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:01,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:51:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:01,361 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:01,398 INFO L263 TraceCheckUtils]: 0: Hoare triple {5085#true} call ULTIMATE.init(); {5085#true} is VALID [2020-07-17 22:51:01,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {5085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5085#true} is VALID [2020-07-17 22:51:01,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-17 22:51:01,398 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5085#true} {5085#true} #151#return; {5085#true} is VALID [2020-07-17 22:51:01,399 INFO L263 TraceCheckUtils]: 4: Hoare triple {5085#true} call #t~ret23 := main(); {5085#true} is VALID [2020-07-17 22:51:01,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {5085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {5085#true} is VALID [2020-07-17 22:51:01,399 INFO L280 TraceCheckUtils]: 6: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-17 22:51:01,399 INFO L280 TraceCheckUtils]: 7: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-17 22:51:01,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-17 22:51:01,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-17 22:51:01,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-17 22:51:01,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-17 22:51:01,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-17 22:51:01,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {5085#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet21 && #t~nondet21 <= 127;call write~int(#t~nondet21, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet21; {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {5085#true} #t~post20 := ~i~1;~i~1 := 1 + #t~post20;havoc #t~post20; {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L280 TraceCheckUtils]: 16: Hoare triple {5085#true} assume !(~i~1 < 8); {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L280 TraceCheckUtils]: 17: Hoare triple {5085#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L263 TraceCheckUtils]: 18: Hoare triple {5085#true} call #t~ret22 := parse_expression_list(~#A~0.base, ~#A~0.offset); {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L280 TraceCheckUtils]: 19: Hoare triple {5085#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {5085#true} is VALID [2020-07-17 22:51:01,401 INFO L280 TraceCheckUtils]: 20: Hoare triple {5085#true} assume !(~str.base == 0 && ~str.offset == 0); {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 21: Hoare triple {5085#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 22: Hoare triple {5085#true} assume !#t~switch4; {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 23: Hoare triple {5085#true} havoc #t~mem3;havoc #t~switch4; {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 24: Hoare triple {5085#true} call #t~mem1 := read~int(~str.base, ~str.offset + ~i~0, 1); {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 25: Hoare triple {5085#true} assume !!(0 != #t~mem1);havoc #t~mem1; {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 26: Hoare triple {5085#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;call #t~mem3 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch4 := 0 == #t~mem3; {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 27: Hoare triple {5085#true} assume #t~switch4; {5085#true} is VALID [2020-07-17 22:51:01,402 INFO L280 TraceCheckUtils]: 28: Hoare triple {5085#true} call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 32 == #t~mem5; {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 29: Hoare triple {5085#true} assume !#t~short7;call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short7 := 9 == #t~mem6; {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 30: Hoare triple {5085#true} assume !#t~short7;havoc #t~mem5;havoc #t~short7;havoc #t~mem6; {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 31: Hoare triple {5085#true} call #t~mem9 := read~int(~str.base, ~str.offset + ~start~0, 1); {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 32: Hoare triple {5085#true} assume !(34 == #t~mem9);havoc #t~mem9; {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 33: Hoare triple {5085#true} ~j~0 := ~i~0 - 1; {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 34: Hoare triple {5085#true} #t~short14 := 0 < ~j~0; {5085#true} is VALID [2020-07-17 22:51:01,403 INFO L280 TraceCheckUtils]: 35: Hoare triple {5085#true} assume !#t~short14; {5085#true} is VALID [2020-07-17 22:51:01,404 INFO L280 TraceCheckUtils]: 36: Hoare triple {5085#true} assume !#t~short14;havoc #t~short14;havoc #t~mem11;havoc #t~short13;havoc #t~mem12; {5085#true} is VALID [2020-07-17 22:51:01,404 INFO L280 TraceCheckUtils]: 37: Hoare triple {5085#true} #t~short17 := 0 < ~j~0; {5085#true} is VALID [2020-07-17 22:51:01,404 INFO L280 TraceCheckUtils]: 38: Hoare triple {5085#true} assume !#t~short17; {5085#true} is VALID [2020-07-17 22:51:01,404 INFO L280 TraceCheckUtils]: 39: Hoare triple {5085#true} assume !#t~short17;havoc #t~short17;havoc #t~mem16; {5085#true} is VALID [2020-07-17 22:51:01,404 INFO L280 TraceCheckUtils]: 40: Hoare triple {5085#true} assume ~start~0 <= ~j~0; {5085#true} is VALID [2020-07-17 22:51:01,405 INFO L280 TraceCheckUtils]: 41: Hoare triple {5085#true} assume !(1 + (~j~0 - ~start~0) >= 2); {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-17 22:51:01,405 INFO L263 TraceCheckUtils]: 42: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call #t~ret19.base, #t~ret19.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {5085#true} is VALID [2020-07-17 22:51:01,405 INFO L280 TraceCheckUtils]: 43: Hoare triple {5085#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret0.base, #t~ret0.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; {5085#true} is VALID [2020-07-17 22:51:01,405 INFO L280 TraceCheckUtils]: 44: Hoare triple {5085#true} assume true; {5085#true} is VALID [2020-07-17 22:51:01,406 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5085#true} {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} #147#return; {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-17 22:51:01,406 INFO L280 TraceCheckUtils]: 46: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} havoc #t~ret19.base, #t~ret19.offset; {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} is VALID [2020-07-17 22:51:01,407 INFO L263 TraceCheckUtils]: 47: Hoare triple {5226#(< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {5245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:01,408 INFO L280 TraceCheckUtils]: 48: Hoare triple {5245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:01,408 INFO L280 TraceCheckUtils]: 49: Hoare triple {5249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5086#false} is VALID [2020-07-17 22:51:01,408 INFO L280 TraceCheckUtils]: 50: Hoare triple {5086#false} assume !false; {5086#false} is VALID [2020-07-17 22:51:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-17 22:51:01,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:51:01,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2020-07-17 22:51:01,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824708057] [2020-07-17 22:51:01,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-17 22:51:01,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:01,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:01,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:01,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:01,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:01,455 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 5 states. [2020-07-17 22:51:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:01,684 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2020-07-17 22:51:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:01,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-17 22:51:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-17 22:51:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-17 22:51:01,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2020-07-17 22:51:01,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:01,766 INFO L225 Difference]: With dead ends: 86 [2020-07-17 22:51:01,767 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:01,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:51:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:01,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:01,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:01,768 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:01,768 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:01,769 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:01,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:01,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:01,769 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:01,769 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:01,770 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:01,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:01,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:01,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:01,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:01,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-17 22:51:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:01,771 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:01,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:01,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:01,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:01,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:02,108 INFO L268 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2020-07-17 22:51:02,109 INFO L268 CegarLoopResult]: For program point L60-2(line 60) no Hoare annotation was computed. [2020-07-17 22:51:02,109 INFO L268 CegarLoopResult]: For program point L60-4(lines 54 72) no Hoare annotation was computed. [2020-07-17 22:51:02,109 INFO L268 CegarLoopResult]: For program point L56-1(line 56) no Hoare annotation was computed. [2020-07-17 22:51:02,109 INFO L268 CegarLoopResult]: For program point L56-3(line 56) no Hoare annotation was computed. [2020-07-17 22:51:02,109 INFO L271 CegarLoopResult]: At program point L56-5(line 56) the Hoare annotation is: true [2020-07-17 22:51:02,110 INFO L268 CegarLoopResult]: For program point L52-1(lines 52 73) no Hoare annotation was computed. [2020-07-17 22:51:02,110 INFO L268 CegarLoopResult]: For program point L56-6(line 56) no Hoare annotation was computed. [2020-07-17 22:51:02,110 INFO L268 CegarLoopResult]: For program point L52-2(lines 52 73) no Hoare annotation was computed. [2020-07-17 22:51:02,110 INFO L271 CegarLoopResult]: At program point L52-4(lines 52 73) the Hoare annotation is: true [2020-07-17 22:51:02,111 INFO L268 CegarLoopResult]: For program point L52-5(lines 52 73) no Hoare annotation was computed. [2020-07-17 22:51:02,111 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-07-17 22:51:02,112 INFO L268 CegarLoopResult]: For program point L65-1(line 65) no Hoare annotation was computed. [2020-07-17 22:51:02,112 INFO L268 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2020-07-17 22:51:02,112 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-17 22:51:02,112 INFO L268 CegarLoopResult]: For program point L57-2(line 57) no Hoare annotation was computed. [2020-07-17 22:51:02,112 INFO L264 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-07-17 22:51:02,112 INFO L268 CegarLoopResult]: For program point L66-1(line 66) no Hoare annotation was computed. [2020-07-17 22:51:02,112 INFO L268 CegarLoopResult]: For program point parse_expression_listFINAL(lines 47 75) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point L62(lines 62 64) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L264 CegarLoopResult]: At program point parse_expression_listENTRY(lines 47 75) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point L54(lines 54 72) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point parse_expression_listEXIT(lines 47 75) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point L59-1(line 59) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point L59-2(line 59) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2020-07-17 22:51:02,113 INFO L268 CegarLoopResult]: For program point L59-4(line 59) no Hoare annotation was computed. [2020-07-17 22:51:02,114 INFO L268 CegarLoopResult]: For program point L59-6(line 59) no Hoare annotation was computed. [2020-07-17 22:51:02,114 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-17 22:51:02,114 INFO L271 CegarLoopResult]: At program point L59-8(line 59) the Hoare annotation is: true [2020-07-17 22:51:02,114 INFO L268 CegarLoopResult]: For program point L59-9(line 59) no Hoare annotation was computed. [2020-07-17 22:51:02,114 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:02,114 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 22:51:02,114 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:02,115 INFO L268 CegarLoopResult]: For program point r_strncpyFINAL(line 31) no Hoare annotation was computed. [2020-07-17 22:51:02,115 INFO L268 CegarLoopResult]: For program point r_strncpyEXIT(line 31) no Hoare annotation was computed. [2020-07-17 22:51:02,115 INFO L271 CegarLoopResult]: At program point r_strncpyENTRY(line 31) the Hoare annotation is: true [2020-07-17 22:51:02,115 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:02,115 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:02,115 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:02,116 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:02,116 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 76 85) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 22:51:02,116 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 76 85) no Hoare annotation was computed. [2020-07-17 22:51:02,116 INFO L271 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: true [2020-07-17 22:51:02,117 INFO L268 CegarLoopResult]: For program point L83-1(line 83) no Hoare annotation was computed. [2020-07-17 22:51:02,117 INFO L268 CegarLoopResult]: For program point L79-2(lines 79 81) no Hoare annotation was computed. [2020-07-17 22:51:02,117 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 76 85) no Hoare annotation was computed. [2020-07-17 22:51:02,117 INFO L271 CegarLoopResult]: At program point L79-3(lines 79 81) the Hoare annotation is: true [2020-07-17 22:51:02,117 INFO L268 CegarLoopResult]: For program point L79-4(lines 79 81) no Hoare annotation was computed. [2020-07-17 22:51:02,117 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-17 22:51:02,117 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:51:02,117 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:51:02,118 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:51:02,118 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-17 22:51:02,118 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:51:02,123 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:51:02,124 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:02,124 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-17 22:51:02,128 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:02,129 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:51:02,129 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:51:02,129 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:02,129 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2020-07-17 22:51:02,129 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:02,130 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:51:02,131 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:02,132 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2020-07-17 22:51:02,132 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:02,132 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:02,132 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-17 22:51:02,132 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-17 22:51:02,132 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-17 22:51:02,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:02,133 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-17 22:51:02,133 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-17 22:51:02,133 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-17 22:51:02,133 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-17 22:51:02,134 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-17 22:51:02,135 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-17 22:51:02,136 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-17 22:51:02,137 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-17 22:51:02,138 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:02,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:02 BoogieIcfgContainer [2020-07-17 22:51:02,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:02,153 INFO L168 Benchmark]: Toolchain (without parser) took 14409.53 ms. Allocated memory was 136.8 MB in the beginning and 371.2 MB in the end (delta: 234.4 MB). Free memory was 101.2 MB in the beginning and 226.4 MB in the end (delta: -125.3 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:02,154 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:02,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.53 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 177.1 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:02,157 INFO L168 Benchmark]: Boogie Preprocessor took 66.49 ms. Allocated memory is still 200.3 MB. Free memory was 177.1 MB in the beginning and 174.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:02,160 INFO L168 Benchmark]: RCFGBuilder took 697.06 ms. Allocated memory is still 200.3 MB. Free memory was 174.4 MB in the beginning and 131.6 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:02,161 INFO L168 Benchmark]: TraceAbstraction took 13192.17 ms. Allocated memory was 200.3 MB in the beginning and 371.2 MB in the end (delta: 170.9 MB). Free memory was 131.0 MB in the beginning and 226.4 MB in the end (delta: -95.5 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:02,167 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.19 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 446.53 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 177.1 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.49 ms. Allocated memory is still 200.3 MB. Free memory was 177.1 MB in the beginning and 174.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 697.06 ms. Allocated memory is still 200.3 MB. Free memory was 174.4 MB in the beginning and 131.6 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13192.17 ms. Allocated memory was 200.3 MB in the beginning and 371.2 MB in the end (delta: 170.9 MB). Free memory was 131.0 MB in the beginning and 226.4 MB in the end (delta: -95.5 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.9s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 562 SDtfs, 239 SDslu, 1419 SDs, 0 SdLazy, 787 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 64 PreInvPairs, 94 NumberOfFragments, 35 HoareAnnotationTreeSize, 64 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 896 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 62932 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1443 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 72/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...