/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:24:51,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:24:51,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:24:51,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:24:51,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:24:51,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:24:51,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:24:51,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:24:51,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:24:51,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:24:51,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:24:51,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:24:51,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:24:51,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:24:51,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:24:51,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:24:51,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:24:51,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:24:51,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:24:51,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:24:51,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:24:51,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:24:51,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:24:51,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:24:51,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:24:51,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:24:51,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:24:51,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:24:51,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:24:51,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:24:51,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:24:51,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:24:51,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:24:51,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:24:51,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:24:51,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:24:51,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:24:51,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:24:51,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:24:51,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:24:51,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:24:51,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:24:51,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:24:51,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:24:51,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:24:51,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:24:51,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:24:51,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:24:51,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:24:51,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:24:51,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:24:51,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:24:51,668 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:24:51,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:24:51,669 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:24:51,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:24:51,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:24:51,670 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:24:51,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:24:51,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:24:51,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:24:51,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:24:51,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:24:51,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:24:51,671 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:24:52,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:24:52,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:24:52,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:24:52,065 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:24:52,066 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:24:52,067 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-18 00:24:52,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3bb685a/926808ac6129469a80d627dcf66e442d/FLAG9d4461e65 [2020-07-18 00:24:52,905 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:24:52,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-18 00:24:52,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3bb685a/926808ac6129469a80d627dcf66e442d/FLAG9d4461e65 [2020-07-18 00:24:53,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3bb685a/926808ac6129469a80d627dcf66e442d [2020-07-18 00:24:53,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:24:53,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:24:53,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:24:53,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:24:53,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:24:53,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:53,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9673511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53, skipping insertion in model container [2020-07-18 00:24:53,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:53,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:24:53,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:24:53,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:24:53,784 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:24:53,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:24:53,923 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:24:53,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53 WrapperNode [2020-07-18 00:24:53,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:24:53,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:24:53,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:24:53,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:24:53,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:53,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:53,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:53,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:53,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:54,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:54,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (1/1) ... [2020-07-18 00:24:54,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:24:54,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:24:54,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:24:54,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:24:54,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (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-18 00:24:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:24:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:24:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-18 00:24:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-18 00:24:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-18 00:24:54,110 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-18 00:24:54,110 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-18 00:24:54,110 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2020-07-18 00:24:54,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:24:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:24:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-18 00:24:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-18 00:24:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:24:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:24:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:24:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:24:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:24:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:24:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:24:54,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:24:54,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:24:54,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:24:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:24:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:24:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:24:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:24:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:24:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:24:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:24:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:24:54,125 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:24:54,125 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:24:54,125 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:24:54,125 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:24:54,125 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:24:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:24:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:24:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:24:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:24:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:24:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:24:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:24:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:24:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:24:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:24:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:24:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:24:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:24:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:24:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:24:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:24:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:24:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:24:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:24:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:24:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:24:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:24:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:24:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:24:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:24:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:24:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:24:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:24:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:24:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:24:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:24:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:24:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:24:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:24:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:24:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:24:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:24:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:24:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:24:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:24:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:24:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:24:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:24:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:24:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:24:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:24:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:24:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:24:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:24:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:24:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:24:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:24:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:24:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:24:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:24:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:24:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:24:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:24:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:24:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:24:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-18 00:24:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-18 00:24:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:24:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:24:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:24:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-18 00:24:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2020-07-18 00:24:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:24:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:24:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:24:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:24:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-18 00:24:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:24:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:24:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:24:54,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-18 00:24:55,161 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:24:55,162 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:24:55,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:24:55 BoogieIcfgContainer [2020-07-18 00:24:55,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:24:55,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:24:55,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:24:55,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:24:55,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:24:53" (1/3) ... [2020-07-18 00:24:55,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672924d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:24:55, skipping insertion in model container [2020-07-18 00:24:55,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:53" (2/3) ... [2020-07-18 00:24:55,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672924d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:24:55, skipping insertion in model container [2020-07-18 00:24:55,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:24:55" (3/3) ... [2020-07-18 00:24:55,185 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2020-07-18 00:24:55,201 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:24:55,215 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:24:55,240 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:24:55,276 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:24:55,276 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:24:55,277 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:24:55,286 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:24:55,286 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:24:55,287 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:24:55,287 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:24:55,287 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:24:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2020-07-18 00:24:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:24:55,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:55,344 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] [2020-07-18 00:24:55,344 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1728925643, now seen corresponding path program 1 times [2020-07-18 00:24:55,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:55,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223340022] [2020-07-18 00:24:55,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:55,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {75#true} is VALID [2020-07-18 00:24:55,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#true} #valid := #valid[0 := 0]; {75#true} is VALID [2020-07-18 00:24:55,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#true} assume 0 < #StackHeapBarrier; {75#true} is VALID [2020-07-18 00:24:55,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-18 00:24:55,706 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {75#true} {75#true} #143#return; {75#true} is VALID [2020-07-18 00:24:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:55,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {75#true} is VALID [2020-07-18 00:24:55,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#true} ~data := #in~data; {75#true} is VALID [2020-07-18 00:24:55,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#true} ~head~0.base, ~head~0.offset := 0, 0; {75#true} is VALID [2020-07-18 00:24:55,750 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#true} assume !(~len > 0); {75#true} is VALID [2020-07-18 00:24:55,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {75#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {75#true} is VALID [2020-07-18 00:24:55,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-18 00:24:55,752 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {75#true} {75#true} #137#return; {75#true} is VALID [2020-07-18 00:24:55,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {75#true} call ULTIMATE.init(); {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:55,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {75#true} is VALID [2020-07-18 00:24:55,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#true} #valid := #valid[0 := 0]; {75#true} is VALID [2020-07-18 00:24:55,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#true} assume 0 < #StackHeapBarrier; {75#true} is VALID [2020-07-18 00:24:55,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-18 00:24:55,756 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {75#true} {75#true} #143#return; {75#true} is VALID [2020-07-18 00:24:55,756 INFO L263 TraceCheckUtils]: 6: Hoare triple {75#true} call #t~ret11 := main(); {75#true} is VALID [2020-07-18 00:24:55,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {75#true} ~len~0 := 2; {75#true} is VALID [2020-07-18 00:24:55,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {75#true} ~data~0 := 1; {75#true} is VALID [2020-07-18 00:24:55,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {75#true} SUMMARY for call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); srcloc: L603 {75#true} is VALID [2020-07-18 00:24:55,761 INFO L263 TraceCheckUtils]: 10: Hoare triple {75#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {90#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:24:55,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {75#true} is VALID [2020-07-18 00:24:55,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {75#true} ~data := #in~data; {75#true} is VALID [2020-07-18 00:24:55,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {75#true} ~head~0.base, ~head~0.offset := 0, 0; {75#true} is VALID [2020-07-18 00:24:55,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {75#true} assume !(~len > 0); {75#true} is VALID [2020-07-18 00:24:55,762 INFO L280 TraceCheckUtils]: 15: Hoare triple {75#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {75#true} is VALID [2020-07-18 00:24:55,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-18 00:24:55,763 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {75#true} {75#true} #137#return; {75#true} is VALID [2020-07-18 00:24:55,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {75#true} SUMMARY for call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4); srcloc: L603-2 {75#true} is VALID [2020-07-18 00:24:55,764 INFO L280 TraceCheckUtils]: 19: Hoare triple {75#true} havoc #t~ret8.base, #t~ret8.offset; {75#true} is VALID [2020-07-18 00:24:55,764 INFO L280 TraceCheckUtils]: 20: Hoare triple {75#true} havoc ~i~0; {75#true} is VALID [2020-07-18 00:24:55,764 INFO L280 TraceCheckUtils]: 21: Hoare triple {75#true} ~i~0 := ~len~0 - 1; {75#true} is VALID [2020-07-18 00:24:55,765 INFO L280 TraceCheckUtils]: 22: Hoare triple {75#true} assume !true; {76#false} is VALID [2020-07-18 00:24:55,766 INFO L280 TraceCheckUtils]: 23: Hoare triple {76#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); srcloc: L605-6 {76#false} is VALID [2020-07-18 00:24:55,766 INFO L280 TraceCheckUtils]: 24: Hoare triple {76#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset; {76#false} is VALID [2020-07-18 00:24:55,766 INFO L280 TraceCheckUtils]: 25: Hoare triple {76#false} havoc #t~mem10.base, #t~mem10.offset; {76#false} is VALID [2020-07-18 00:24:55,767 INFO L280 TraceCheckUtils]: 26: Hoare triple {76#false} assume !false; {76#false} is VALID [2020-07-18 00:24:55,771 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-18 00:24:55,774 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:55,776 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223340022] [2020-07-18 00:24:55,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:24:55,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224795231] [2020-07-18 00:24:55,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-18 00:24:55,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:55,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:24:55,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:55,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:24:55,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:24:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:55,875 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 4 states. [2020-07-18 00:24:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:56,731 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2020-07-18 00:24:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:24:56,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-18 00:24:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-07-18 00:24:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-07-18 00:24:56,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 130 transitions. [2020-07-18 00:24:57,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:57,070 INFO L225 Difference]: With dead ends: 118 [2020-07-18 00:24:57,070 INFO L226 Difference]: Without dead ends: 65 [2020-07-18 00:24:57,077 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:24:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-18 00:24:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2020-07-18 00:24:57,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:57,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 58 states. [2020-07-18 00:24:57,236 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 58 states. [2020-07-18 00:24:57,236 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 58 states. [2020-07-18 00:24:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:57,244 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-18 00:24:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-18 00:24:57,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:57,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:57,246 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 65 states. [2020-07-18 00:24:57,246 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 65 states. [2020-07-18 00:24:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:57,253 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-18 00:24:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-18 00:24:57,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:57,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:57,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:57,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-18 00:24:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2020-07-18 00:24:57,261 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 27 [2020-07-18 00:24:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:57,262 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2020-07-18 00:24:57,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:24:57,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 61 transitions. [2020-07-18 00:24:57,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2020-07-18 00:24:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:24:57,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:57,379 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] [2020-07-18 00:24:57,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:24:57,380 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1737237332, now seen corresponding path program 1 times [2020-07-18 00:24:57,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:57,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613381908] [2020-07-18 00:24:57,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:57,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {578#true} is VALID [2020-07-18 00:24:57,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {578#true} #valid := #valid[0 := 0]; {578#true} is VALID [2020-07-18 00:24:57,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#true} assume 0 < #StackHeapBarrier; {578#true} is VALID [2020-07-18 00:24:57,522 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-18 00:24:57,522 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {578#true} {578#true} #143#return; {578#true} is VALID [2020-07-18 00:24:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:57,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {578#true} is VALID [2020-07-18 00:24:57,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {578#true} ~data := #in~data; {578#true} is VALID [2020-07-18 00:24:57,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#true} ~head~0.base, ~head~0.offset := 0, 0; {578#true} is VALID [2020-07-18 00:24:57,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#true} assume !(~len > 0); {578#true} is VALID [2020-07-18 00:24:57,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {578#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {578#true} is VALID [2020-07-18 00:24:57,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-18 00:24:57,577 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {578#true} {585#(<= 2 main_~len~0)} #137#return; {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,579 INFO L263 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:57,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {578#true} is VALID [2020-07-18 00:24:57,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#true} #valid := #valid[0 := 0]; {578#true} is VALID [2020-07-18 00:24:57,580 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#true} assume 0 < #StackHeapBarrier; {578#true} is VALID [2020-07-18 00:24:57,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-18 00:24:57,580 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {578#true} {578#true} #143#return; {578#true} is VALID [2020-07-18 00:24:57,581 INFO L263 TraceCheckUtils]: 6: Hoare triple {578#true} call #t~ret11 := main(); {578#true} is VALID [2020-07-18 00:24:57,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {578#true} ~len~0 := 2; {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {585#(<= 2 main_~len~0)} ~data~0 := 1; {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {585#(<= 2 main_~len~0)} SUMMARY for call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); srcloc: L603 {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,588 INFO L263 TraceCheckUtils]: 10: Hoare triple {585#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {595#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:24:57,589 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {578#true} is VALID [2020-07-18 00:24:57,589 INFO L280 TraceCheckUtils]: 12: Hoare triple {578#true} ~data := #in~data; {578#true} is VALID [2020-07-18 00:24:57,590 INFO L280 TraceCheckUtils]: 13: Hoare triple {578#true} ~head~0.base, ~head~0.offset := 0, 0; {578#true} is VALID [2020-07-18 00:24:57,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {578#true} assume !(~len > 0); {578#true} is VALID [2020-07-18 00:24:57,590 INFO L280 TraceCheckUtils]: 15: Hoare triple {578#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {578#true} is VALID [2020-07-18 00:24:57,590 INFO L280 TraceCheckUtils]: 16: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-18 00:24:57,593 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {578#true} {585#(<= 2 main_~len~0)} #137#return; {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,594 INFO L280 TraceCheckUtils]: 18: Hoare triple {585#(<= 2 main_~len~0)} SUMMARY for call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4); srcloc: L603-2 {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,595 INFO L280 TraceCheckUtils]: 19: Hoare triple {585#(<= 2 main_~len~0)} havoc #t~ret8.base, #t~ret8.offset; {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,596 INFO L280 TraceCheckUtils]: 20: Hoare triple {585#(<= 2 main_~len~0)} havoc ~i~0; {585#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:57,598 INFO L280 TraceCheckUtils]: 21: Hoare triple {585#(<= 2 main_~len~0)} ~i~0 := ~len~0 - 1; {593#(<= 1 main_~i~0)} is VALID [2020-07-18 00:24:57,600 INFO L280 TraceCheckUtils]: 22: Hoare triple {593#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {579#false} is VALID [2020-07-18 00:24:57,600 INFO L280 TraceCheckUtils]: 23: Hoare triple {579#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); srcloc: L605-6 {579#false} is VALID [2020-07-18 00:24:57,601 INFO L280 TraceCheckUtils]: 24: Hoare triple {579#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset; {579#false} is VALID [2020-07-18 00:24:57,601 INFO L280 TraceCheckUtils]: 25: Hoare triple {579#false} havoc #t~mem10.base, #t~mem10.offset; {579#false} is VALID [2020-07-18 00:24:57,601 INFO L280 TraceCheckUtils]: 26: Hoare triple {579#false} assume !false; {579#false} is VALID [2020-07-18 00:24:57,603 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-18 00:24:57,608 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:57,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613381908] [2020-07-18 00:24:57,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:57,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:24:57,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386609084] [2020-07-18 00:24:57,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-18 00:24:57,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:57,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:24:57,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:57,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:24:57,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:24:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:24:57,655 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 6 states. [2020-07-18 00:24:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:58,643 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-18 00:24:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:24:58,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-18 00:24:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:24:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-18 00:24:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:24:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-18 00:24:58,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-18 00:24:58,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:58,802 INFO L225 Difference]: With dead ends: 74 [2020-07-18 00:24:58,802 INFO L226 Difference]: Without dead ends: 69 [2020-07-18 00:24:58,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:24:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-18 00:24:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-07-18 00:24:58,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:58,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 59 states. [2020-07-18 00:24:58,926 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 59 states. [2020-07-18 00:24:58,927 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 59 states. [2020-07-18 00:24:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:58,937 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-18 00:24:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-18 00:24:58,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:58,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:58,940 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 69 states. [2020-07-18 00:24:58,941 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 69 states. [2020-07-18 00:24:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:58,955 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-18 00:24:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-18 00:24:58,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:58,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:58,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:58,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-18 00:24:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-18 00:24:58,966 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 27 [2020-07-18 00:24:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:58,966 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-18 00:24:58,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:24:58,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2020-07-18 00:24:59,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-18 00:24:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 00:24:59,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:59,094 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:59,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:24:59,095 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash 278069346, now seen corresponding path program 1 times [2020-07-18 00:24:59,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:59,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [161413848] [2020-07-18 00:24:59,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:59,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {1037#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1009#true} is VALID [2020-07-18 00:24:59,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} #valid := #valid[0 := 0]; {1009#true} is VALID [2020-07-18 00:24:59,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#true} assume 0 < #StackHeapBarrier; {1009#true} is VALID [2020-07-18 00:24:59,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-18 00:24:59,240 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1009#true} {1009#true} #143#return; {1009#true} is VALID [2020-07-18 00:24:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:59,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-18 00:24:59,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~data := #in~data; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-18 00:24:59,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := 0, 0; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-18 00:24:59,336 INFO L280 TraceCheckUtils]: 3: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-18 00:24:59,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {1040#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-18 00:24:59,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#(<= |dll_create_#in~len| 0)} assume true; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-18 00:24:59,341 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1040#(<= |dll_create_#in~len| 0)} {1016#(<= 2 main_~len~0)} #137#return; {1010#false} is VALID [2020-07-18 00:24:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:59,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1009#true} is VALID [2020-07-18 00:24:59,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L593 {1009#true} is VALID [2020-07-18 00:24:59,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4); srcloc: L593-1 {1009#true} is VALID [2020-07-18 00:24:59,433 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#true} ~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-18 00:24:59,433 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} havoc #t~mem5.base, #t~mem5.offset; {1009#true} is VALID [2020-07-18 00:24:59,433 INFO L280 TraceCheckUtils]: 5: Hoare triple {1009#true} havoc #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-18 00:24:59,434 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {1009#true} is VALID [2020-07-18 00:24:59,434 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L594-1 {1009#true} is VALID [2020-07-18 00:24:59,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#true} SUMMARY for call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset); srcloc: L597 {1009#true} is VALID [2020-07-18 00:24:59,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {1009#true} havoc #t~mem7.base, #t~mem7.offset; {1009#true} is VALID [2020-07-18 00:24:59,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {1009#true} SUMMARY for call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); srcloc: L598 {1009#true} is VALID [2020-07-18 00:24:59,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-18 00:24:59,439 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1009#true} {1010#false} #139#return; {1010#false} is VALID [2020-07-18 00:24:59,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1037#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:59,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {1037#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1009#true} is VALID [2020-07-18 00:24:59,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#true} #valid := #valid[0 := 0]; {1009#true} is VALID [2020-07-18 00:24:59,442 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#true} assume 0 < #StackHeapBarrier; {1009#true} is VALID [2020-07-18 00:24:59,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-18 00:24:59,443 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1009#true} {1009#true} #143#return; {1009#true} is VALID [2020-07-18 00:24:59,443 INFO L263 TraceCheckUtils]: 6: Hoare triple {1009#true} call #t~ret11 := main(); {1009#true} is VALID [2020-07-18 00:24:59,450 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} ~len~0 := 2; {1016#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:59,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {1016#(<= 2 main_~len~0)} ~data~0 := 1; {1016#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:59,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#(<= 2 main_~len~0)} SUMMARY for call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); srcloc: L603 {1016#(<= 2 main_~len~0)} is VALID [2020-07-18 00:24:59,455 INFO L263 TraceCheckUtils]: 10: Hoare triple {1016#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1038#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:24:59,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-18 00:24:59,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~data := #in~data; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-18 00:24:59,458 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := 0, 0; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-18 00:24:59,459 INFO L280 TraceCheckUtils]: 14: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-18 00:24:59,459 INFO L280 TraceCheckUtils]: 15: Hoare triple {1040#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-18 00:24:59,460 INFO L280 TraceCheckUtils]: 16: Hoare triple {1040#(<= |dll_create_#in~len| 0)} assume true; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-18 00:24:59,463 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1040#(<= |dll_create_#in~len| 0)} {1016#(<= 2 main_~len~0)} #137#return; {1010#false} is VALID [2020-07-18 00:24:59,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {1010#false} SUMMARY for call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4); srcloc: L603-2 {1010#false} is VALID [2020-07-18 00:24:59,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {1010#false} havoc #t~ret8.base, #t~ret8.offset; {1010#false} is VALID [2020-07-18 00:24:59,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {1010#false} havoc ~i~0; {1010#false} is VALID [2020-07-18 00:24:59,465 INFO L280 TraceCheckUtils]: 21: Hoare triple {1010#false} ~i~0 := ~len~0 - 1; {1010#false} is VALID [2020-07-18 00:24:59,466 INFO L280 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !!(~i~0 >= 0); {1010#false} is VALID [2020-07-18 00:24:59,466 INFO L263 TraceCheckUtils]: 23: Hoare triple {1010#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1041#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:24:59,466 INFO L280 TraceCheckUtils]: 24: Hoare triple {1041#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1009#true} is VALID [2020-07-18 00:24:59,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {1009#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L593 {1009#true} is VALID [2020-07-18 00:24:59,467 INFO L280 TraceCheckUtils]: 26: Hoare triple {1009#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4); srcloc: L593-1 {1009#true} is VALID [2020-07-18 00:24:59,467 INFO L280 TraceCheckUtils]: 27: Hoare triple {1009#true} ~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-18 00:24:59,467 INFO L280 TraceCheckUtils]: 28: Hoare triple {1009#true} havoc #t~mem5.base, #t~mem5.offset; {1009#true} is VALID [2020-07-18 00:24:59,468 INFO L280 TraceCheckUtils]: 29: Hoare triple {1009#true} havoc #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-18 00:24:59,468 INFO L280 TraceCheckUtils]: 30: Hoare triple {1009#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {1009#true} is VALID [2020-07-18 00:24:59,468 INFO L280 TraceCheckUtils]: 31: Hoare triple {1009#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L594-1 {1009#true} is VALID [2020-07-18 00:24:59,469 INFO L280 TraceCheckUtils]: 32: Hoare triple {1009#true} SUMMARY for call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset); srcloc: L597 {1009#true} is VALID [2020-07-18 00:24:59,469 INFO L280 TraceCheckUtils]: 33: Hoare triple {1009#true} havoc #t~mem7.base, #t~mem7.offset; {1009#true} is VALID [2020-07-18 00:24:59,469 INFO L280 TraceCheckUtils]: 34: Hoare triple {1009#true} SUMMARY for call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); srcloc: L598 {1009#true} is VALID [2020-07-18 00:24:59,470 INFO L280 TraceCheckUtils]: 35: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-18 00:24:59,470 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1009#true} {1010#false} #139#return; {1010#false} is VALID [2020-07-18 00:24:59,470 INFO L280 TraceCheckUtils]: 37: Hoare triple {1010#false} #t~post9 := ~i~0; {1010#false} is VALID [2020-07-18 00:24:59,471 INFO L280 TraceCheckUtils]: 38: Hoare triple {1010#false} ~i~0 := #t~post9 - 1; {1010#false} is VALID [2020-07-18 00:24:59,471 INFO L280 TraceCheckUtils]: 39: Hoare triple {1010#false} havoc #t~post9; {1010#false} is VALID [2020-07-18 00:24:59,471 INFO L280 TraceCheckUtils]: 40: Hoare triple {1010#false} assume !(~i~0 >= 0); {1010#false} is VALID [2020-07-18 00:24:59,471 INFO L280 TraceCheckUtils]: 41: Hoare triple {1010#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); srcloc: L605-6 {1010#false} is VALID [2020-07-18 00:24:59,472 INFO L280 TraceCheckUtils]: 42: Hoare triple {1010#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset; {1010#false} is VALID [2020-07-18 00:24:59,472 INFO L280 TraceCheckUtils]: 43: Hoare triple {1010#false} havoc #t~mem10.base, #t~mem10.offset; {1010#false} is VALID [2020-07-18 00:24:59,472 INFO L280 TraceCheckUtils]: 44: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2020-07-18 00:24:59,476 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-18 00:24:59,762 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:59,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [161413848] [2020-07-18 00:24:59,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:59,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-18 00:24:59,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440825465] [2020-07-18 00:24:59,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2020-07-18 00:24:59,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:59,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-18 00:24:59,834 WARN L140 InductivityCheck]: Transition 1050#(and (< main_~i~0 0) (or (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0)))) ( _ , assume !false; , 1010#false ) not inductive [2020-07-18 00:24:59,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:24:59,835 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:24:59,848 INFO L168 Benchmark]: Toolchain (without parser) took 6773.81 ms. Allocated memory was 146.3 MB in the beginning and 279.4 MB in the end (delta: 133.2 MB). Free memory was 102.9 MB in the beginning and 192.8 MB in the end (delta: -89.9 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:59,851 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:24:59,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.08 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 165.7 MB in the end (delta: -63.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:59,859 INFO L168 Benchmark]: Boogie Preprocessor took 96.70 ms. Allocated memory is still 203.9 MB. Free memory was 165.7 MB in the beginning and 162.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:59,861 INFO L168 Benchmark]: RCFGBuilder took 1148.53 ms. Allocated memory is still 203.9 MB. Free memory was 162.5 MB in the beginning and 97.4 MB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:59,863 INFO L168 Benchmark]: TraceAbstraction took 4669.81 ms. Allocated memory was 203.9 MB in the beginning and 279.4 MB in the end (delta: 75.5 MB). Free memory was 97.4 MB in the beginning and 192.8 MB in the end (delta: -95.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:24:59,868 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.39 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.08 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 165.7 MB in the end (delta: -63.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.70 ms. Allocated memory is still 203.9 MB. Free memory was 165.7 MB in the beginning and 162.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1148.53 ms. Allocated memory is still 203.9 MB. Free memory was 162.5 MB in the beginning and 97.4 MB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4669.81 ms. Allocated memory was 203.9 MB in the beginning and 279.4 MB in the end (delta: 75.5 MB). Free memory was 97.4 MB in the beginning and 192.8 MB in the end (delta: -95.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...