/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/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:03:47,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:03:47,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:03:47,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:03:47,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:03:47,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:03:47,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:03:47,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:03:47,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:03:47,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:03:47,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:03:47,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:03:47,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:03:47,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:03:47,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:03:47,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:03:47,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:03:47,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:03:47,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:03:47,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:03:47,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:03:47,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:03:47,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:03:47,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:03:47,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:03:47,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:03:47,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:03:47,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:03:47,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:03:47,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:03:47,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:03:47,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:03:47,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:03:47,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:03:47,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:03:47,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:03:47,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:03:47,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:03:47,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:03:47,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:03:47,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:03:47,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:03:47,707 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:03:47,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:03:47,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:03:47,709 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:03:47,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:03:47,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:03:47,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:03:47,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:03:47,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:03:47,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:03:47,711 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:03:47,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:03:47,711 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:03:47,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:03:47,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:03:47,712 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:03:47,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:03:47,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:03:47,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:03:47,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:03:47,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:03:47,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:03:47,713 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:03:48,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:03:48,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:03:48,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:03:48,023 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:03:48,024 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:03:48,025 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-10 19:03:48,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a5ac062/5a69988752844957ab9cb342edf80dda/FLAGbc6abd738 [2020-07-10 19:03:48,833 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:03:48,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-10 19:03:48,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a5ac062/5a69988752844957ab9cb342edf80dda/FLAGbc6abd738 [2020-07-10 19:03:49,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a5ac062/5a69988752844957ab9cb342edf80dda [2020-07-10 19:03:49,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:03:49,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:03:49,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:03:49,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:03:49,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:03:49,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41662aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49, skipping insertion in model container [2020-07-10 19:03:49,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:03:49,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:03:49,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:03:49,626 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:03:49,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:03:49,757 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:03:49,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49 WrapperNode [2020-07-10 19:03:49,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:03:49,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:03:49,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:03:49,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:03:49,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... [2020-07-10 19:03:49,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:03:49,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:03:49,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:03:49,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:03:49,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:03:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:03:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:03:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:03:49,944 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:03:49,944 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:03:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:03:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:03:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:03:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:03:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:03:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:03:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:03:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:03:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:03:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:03:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:03:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:03:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:03:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:03:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:03:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:03:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:03:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:03:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:03:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:03:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:03:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:03:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:03:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:03:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:03:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:03:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:03:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:03:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:03:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:03:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:03:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:03:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:03:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:03:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:03:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:03:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:03:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:03:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:03:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:03:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:03:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:03:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:03:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:03:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:03:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:03:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:03:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:03:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:03:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:03:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:03:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:03:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:03:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:03:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:03:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:03:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:03:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:03:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:03:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:03:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:03:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:03:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:03:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:03:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:03:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:03:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:03:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:03:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:03:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:03:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:03:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:03:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:03:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:03:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:03:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:03:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:03:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:03:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:03:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:03:51,054 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:03:51,054 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-10 19:03:51,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:03:51 BoogieIcfgContainer [2020-07-10 19:03:51,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:03:51,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:03:51,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:03:51,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:03:51,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:03:49" (1/3) ... [2020-07-10 19:03:51,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b055c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:03:51, skipping insertion in model container [2020-07-10 19:03:51,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:03:49" (2/3) ... [2020-07-10 19:03:51,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b055c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:03:51, skipping insertion in model container [2020-07-10 19:03:51,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:03:51" (3/3) ... [2020-07-10 19:03:51,074 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-07-10 19:03:51,086 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:03:51,096 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-10 19:03:51,109 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-10 19:03:51,130 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:03:51,130 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:03:51,130 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:03:51,131 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:03:51,131 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:03:51,131 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:03:51,131 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:03:51,131 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:03:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-10 19:03:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 19:03:51,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:51,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:03:51,168 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1409190174, now seen corresponding path program 1 times [2020-07-10 19:03:51,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:51,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150398142] [2020-07-10 19:03:51,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:51,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-10 19:03:51,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-10 19:03:51,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-10 19:03:51,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-10 19:03:51,501 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #414#return; {174#true} is VALID [2020-07-10 19:03:51,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:03:51,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-10 19:03:51,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-10 19:03:51,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-10 19:03:51,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-10 19:03:51,507 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #414#return; {174#true} is VALID [2020-07-10 19:03:51,508 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-10 19:03:51,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {181#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-10 19:03:51,510 INFO L280 TraceCheckUtils]: 8: Hoare triple {181#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:03:51,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:03:51,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:03:51,514 INFO L280 TraceCheckUtils]: 11: Hoare triple {182#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {175#false} is VALID [2020-07-10 19:03:51,515 INFO L280 TraceCheckUtils]: 12: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-10 19:03:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:03:51,517 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:51,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150398142] [2020-07-10 19:03:51,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:51,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:03:51,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241734957] [2020-07-10 19:03:51,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 19:03:51,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:51,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:03:51,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:51,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:03:51,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:03:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:03:51,589 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-10 19:03:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:53,228 INFO L93 Difference]: Finished difference Result 359 states and 475 transitions. [2020-07-10 19:03:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:03:53,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 19:03:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:03:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2020-07-10 19:03:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:03:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2020-07-10 19:03:53,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2020-07-10 19:03:53,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:53,940 INFO L225 Difference]: With dead ends: 359 [2020-07-10 19:03:53,941 INFO L226 Difference]: Without dead ends: 194 [2020-07-10 19:03:53,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:03:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-10 19:03:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-10 19:03:54,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:03:54,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-10 19:03:54,278 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-10 19:03:54,278 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-10 19:03:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:54,312 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2020-07-10 19:03:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2020-07-10 19:03:54,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:54,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:54,317 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-10 19:03:54,317 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-10 19:03:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:54,332 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2020-07-10 19:03:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2020-07-10 19:03:54,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:54,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:54,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:03:54,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:03:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-10 19:03:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2020-07-10 19:03:54,357 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 13 [2020-07-10 19:03:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:03:54,358 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2020-07-10 19:03:54,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:03:54,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 173 transitions. [2020-07-10 19:03:54,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2020-07-10 19:03:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 19:03:54,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:54,596 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] [2020-07-10 19:03:54,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:03:54,597 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1469410252, now seen corresponding path program 1 times [2020-07-10 19:03:54,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:54,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482656714] [2020-07-10 19:03:54,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:54,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-10 19:03:54,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-10 19:03:54,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-10 19:03:54,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 19:03:54,709 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1622#true} #414#return; {1622#true} is VALID [2020-07-10 19:03:54,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1630#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:03:54,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-10 19:03:54,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-10 19:03:54,712 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-10 19:03:54,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 19:03:54,713 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1622#true} {1622#true} #414#return; {1622#true} is VALID [2020-07-10 19:03:54,713 INFO L263 TraceCheckUtils]: 6: Hoare triple {1622#true} call #t~ret28 := main(); {1622#true} is VALID [2020-07-10 19:03:54,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {1622#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1622#true} is VALID [2020-07-10 19:03:54,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {1622#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1622#true} is VALID [2020-07-10 19:03:54,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {1622#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {1622#true} is VALID [2020-07-10 19:03:54,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {1622#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {1622#true} is VALID [2020-07-10 19:03:54,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {1622#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1622#true} is VALID [2020-07-10 19:03:54,715 INFO L280 TraceCheckUtils]: 12: Hoare triple {1622#true} goto; {1622#true} is VALID [2020-07-10 19:03:54,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {1622#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1622#true} is VALID [2020-07-10 19:03:54,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {1622#true} assume 0 != #t~nondet1; {1622#true} is VALID [2020-07-10 19:03:54,716 INFO L280 TraceCheckUtils]: 15: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-10 19:03:54,716 INFO L280 TraceCheckUtils]: 16: Hoare triple {1622#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {1622#true} is VALID [2020-07-10 19:03:54,716 INFO L280 TraceCheckUtils]: 17: Hoare triple {1622#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {1622#true} is VALID [2020-07-10 19:03:54,717 INFO L280 TraceCheckUtils]: 18: Hoare triple {1622#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1622#true} is VALID [2020-07-10 19:03:54,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {1622#true} assume #t~short7; {1629#|main_#t~short7|} is VALID [2020-07-10 19:03:54,718 INFO L280 TraceCheckUtils]: 20: Hoare triple {1629#|main_#t~short7|} assume !#t~short7; {1623#false} is VALID [2020-07-10 19:03:54,719 INFO L280 TraceCheckUtils]: 21: Hoare triple {1623#false} havoc #t~mem6.base, #t~mem6.offset; {1623#false} is VALID [2020-07-10 19:03:54,719 INFO L280 TraceCheckUtils]: 22: Hoare triple {1623#false} havoc #t~mem5.base, #t~mem5.offset; {1623#false} is VALID [2020-07-10 19:03:54,719 INFO L280 TraceCheckUtils]: 23: Hoare triple {1623#false} havoc #t~short7; {1623#false} is VALID [2020-07-10 19:03:54,720 INFO L280 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-10 19:03:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:03:54,722 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:54,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482656714] [2020-07-10 19:03:54,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:54,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:03:54,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914179812] [2020-07-10 19:03:54,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 19:03:54,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:54,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:03:54,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:54,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:03:54,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:54,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:03:54,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:03:54,754 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 4 states. [2020-07-10 19:03:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:55,705 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2020-07-10 19:03:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:03:55,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 19:03:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:03:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2020-07-10 19:03:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:03:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2020-07-10 19:03:55,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2020-07-10 19:03:55,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:55,932 INFO L225 Difference]: With dead ends: 170 [2020-07-10 19:03:55,932 INFO L226 Difference]: Without dead ends: 165 [2020-07-10 19:03:55,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:03:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-10 19:03:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-10 19:03:56,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:03:56,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-10 19:03:56,230 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-10 19:03:56,231 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-10 19:03:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:56,239 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-07-10 19:03:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-10 19:03:56,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:56,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:56,242 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-10 19:03:56,242 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-10 19:03:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:56,249 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-07-10 19:03:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-10 19:03:56,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:56,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:56,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:03:56,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:03:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-10 19:03:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2020-07-10 19:03:56,257 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 25 [2020-07-10 19:03:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:03:56,257 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2020-07-10 19:03:56,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:03:56,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 174 transitions. [2020-07-10 19:03:56,502 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-10 19:03:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-10 19:03:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 19:03:56,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:56,503 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-10 19:03:56,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:03:56,504 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash -155961871, now seen corresponding path program 1 times [2020-07-10 19:03:56,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:56,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820901622] [2020-07-10 19:03:56,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:03:56,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {2645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2633#true} is VALID [2020-07-10 19:03:56,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {2633#true} #valid := #valid[0 := 0]; {2633#true} is VALID [2020-07-10 19:03:56,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {2633#true} assume 0 < #StackHeapBarrier; {2633#true} is VALID [2020-07-10 19:03:56,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {2633#true} assume true; {2633#true} is VALID [2020-07-10 19:03:56,691 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2633#true} {2633#true} #414#return; {2633#true} is VALID [2020-07-10 19:03:56,692 INFO L263 TraceCheckUtils]: 0: Hoare triple {2633#true} call ULTIMATE.init(); {2645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:03:56,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {2645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2633#true} is VALID [2020-07-10 19:03:56,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {2633#true} #valid := #valid[0 := 0]; {2633#true} is VALID [2020-07-10 19:03:56,693 INFO L280 TraceCheckUtils]: 3: Hoare triple {2633#true} assume 0 < #StackHeapBarrier; {2633#true} is VALID [2020-07-10 19:03:56,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {2633#true} assume true; {2633#true} is VALID [2020-07-10 19:03:56,694 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2633#true} {2633#true} #414#return; {2633#true} is VALID [2020-07-10 19:03:56,694 INFO L263 TraceCheckUtils]: 6: Hoare triple {2633#true} call #t~ret28 := main(); {2633#true} is VALID [2020-07-10 19:03:56,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {2633#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2633#true} is VALID [2020-07-10 19:03:56,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {2633#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2633#true} is VALID [2020-07-10 19:03:56,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {2633#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {2633#true} is VALID [2020-07-10 19:03:56,695 INFO L280 TraceCheckUtils]: 10: Hoare triple {2633#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {2633#true} is VALID [2020-07-10 19:03:56,696 INFO L280 TraceCheckUtils]: 11: Hoare triple {2633#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2633#true} is VALID [2020-07-10 19:03:56,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {2633#true} goto; {2633#true} is VALID [2020-07-10 19:03:56,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {2633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2633#true} is VALID [2020-07-10 19:03:56,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {2633#true} assume 0 != #t~nondet1; {2633#true} is VALID [2020-07-10 19:03:56,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {2633#true} havoc #t~nondet1; {2633#true} is VALID [2020-07-10 19:03:56,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {2633#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {2633#true} is VALID [2020-07-10 19:03:56,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {2633#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {2640#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:03:56,700 INFO L280 TraceCheckUtils]: 18: Hoare triple {2640#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2641#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-10 19:03:56,701 INFO L280 TraceCheckUtils]: 19: Hoare triple {2641#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7; {2642#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:03:56,703 INFO L280 TraceCheckUtils]: 20: Hoare triple {2642#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {2643#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} is VALID [2020-07-10 19:03:56,704 INFO L280 TraceCheckUtils]: 21: Hoare triple {2643#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2644#|main_#t~short7|} is VALID [2020-07-10 19:03:56,705 INFO L280 TraceCheckUtils]: 22: Hoare triple {2644#|main_#t~short7|} assume !#t~short7; {2634#false} is VALID [2020-07-10 19:03:56,705 INFO L280 TraceCheckUtils]: 23: Hoare triple {2634#false} havoc #t~mem6.base, #t~mem6.offset; {2634#false} is VALID [2020-07-10 19:03:56,705 INFO L280 TraceCheckUtils]: 24: Hoare triple {2634#false} havoc #t~mem5.base, #t~mem5.offset; {2634#false} is VALID [2020-07-10 19:03:56,706 INFO L280 TraceCheckUtils]: 25: Hoare triple {2634#false} havoc #t~short7; {2634#false} is VALID [2020-07-10 19:03:56,706 INFO L280 TraceCheckUtils]: 26: Hoare triple {2634#false} assume !false; {2634#false} is VALID [2020-07-10 19:03:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:03:56,708 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:03:56,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820901622] [2020-07-10 19:03:56,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:03:56,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:03:56,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118081480] [2020-07-10 19:03:56,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 19:03:56,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:03:56,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:03:56,741 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-10 19:03:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:03:56,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:03:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:03:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:03:56,743 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 8 states. [2020-07-10 19:03:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:58,892 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2020-07-10 19:03:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 19:03:58,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 19:03:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:03:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:03:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions. [2020-07-10 19:03:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:03:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions. [2020-07-10 19:03:58,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 269 transitions. [2020-07-10 19:03:59,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:59,258 INFO L225 Difference]: With dead ends: 254 [2020-07-10 19:03:59,258 INFO L226 Difference]: Without dead ends: 249 [2020-07-10 19:03:59,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-07-10 19:03:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-10 19:03:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 159. [2020-07-10 19:03:59,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:03:59,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 159 states. [2020-07-10 19:03:59,662 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 159 states. [2020-07-10 19:03:59,663 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 159 states. [2020-07-10 19:03:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:59,673 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2020-07-10 19:03:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 264 transitions. [2020-07-10 19:03:59,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:59,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:59,674 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 249 states. [2020-07-10 19:03:59,675 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 249 states. [2020-07-10 19:03:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:03:59,684 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2020-07-10 19:03:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 264 transitions. [2020-07-10 19:03:59,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:03:59,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:03:59,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:03:59,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:03:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-10 19:03:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2020-07-10 19:03:59,692 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 27 [2020-07-10 19:03:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:03:59,692 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2020-07-10 19:03:59,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:03:59,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 168 transitions. [2020-07-10 19:03:59,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:03:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2020-07-10 19:03:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 19:03:59,975 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:03:59,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:03:59,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:03:59,976 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:03:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:03:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1500955686, now seen corresponding path program 1 times [2020-07-10 19:03:59,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:03:59,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58665619] [2020-07-10 19:03:59,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:03:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:00,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {3996#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3986#true} is VALID [2020-07-10 19:04:00,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {3986#true} #valid := #valid[0 := 0]; {3986#true} is VALID [2020-07-10 19:04:00,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {3986#true} assume 0 < #StackHeapBarrier; {3986#true} is VALID [2020-07-10 19:04:00,105 INFO L280 TraceCheckUtils]: 3: Hoare triple {3986#true} assume true; {3986#true} is VALID [2020-07-10 19:04:00,105 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3986#true} {3986#true} #414#return; {3986#true} is VALID [2020-07-10 19:04:00,106 INFO L263 TraceCheckUtils]: 0: Hoare triple {3986#true} call ULTIMATE.init(); {3996#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:00,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {3996#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3986#true} is VALID [2020-07-10 19:04:00,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {3986#true} #valid := #valid[0 := 0]; {3986#true} is VALID [2020-07-10 19:04:00,106 INFO L280 TraceCheckUtils]: 3: Hoare triple {3986#true} assume 0 < #StackHeapBarrier; {3986#true} is VALID [2020-07-10 19:04:00,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {3986#true} assume true; {3986#true} is VALID [2020-07-10 19:04:00,107 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3986#true} {3986#true} #414#return; {3986#true} is VALID [2020-07-10 19:04:00,107 INFO L263 TraceCheckUtils]: 6: Hoare triple {3986#true} call #t~ret28 := main(); {3986#true} is VALID [2020-07-10 19:04:00,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {3986#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3986#true} is VALID [2020-07-10 19:04:00,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {3986#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {3986#true} is VALID [2020-07-10 19:04:00,108 INFO L280 TraceCheckUtils]: 9: Hoare triple {3986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {3986#true} is VALID [2020-07-10 19:04:00,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {3986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {3986#true} is VALID [2020-07-10 19:04:00,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {3986#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3986#true} is VALID [2020-07-10 19:04:00,109 INFO L280 TraceCheckUtils]: 12: Hoare triple {3986#true} goto; {3986#true} is VALID [2020-07-10 19:04:00,109 INFO L280 TraceCheckUtils]: 13: Hoare triple {3986#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3986#true} is VALID [2020-07-10 19:04:00,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {3986#true} assume 0 != #t~nondet1; {3986#true} is VALID [2020-07-10 19:04:00,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {3986#true} havoc #t~nondet1; {3986#true} is VALID [2020-07-10 19:04:00,111 INFO L280 TraceCheckUtils]: 16: Hoare triple {3986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {3993#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:00,111 INFO L280 TraceCheckUtils]: 17: Hoare triple {3993#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {3994#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:00,112 INFO L280 TraceCheckUtils]: 18: Hoare triple {3994#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3995#(not |main_#t~short7|)} is VALID [2020-07-10 19:04:00,113 INFO L280 TraceCheckUtils]: 19: Hoare triple {3995#(not |main_#t~short7|)} assume #t~short7; {3987#false} is VALID [2020-07-10 19:04:00,113 INFO L280 TraceCheckUtils]: 20: Hoare triple {3987#false} assume !!#t~short7; {3987#false} is VALID [2020-07-10 19:04:00,114 INFO L280 TraceCheckUtils]: 21: Hoare triple {3987#false} havoc #t~mem6.base, #t~mem6.offset; {3987#false} is VALID [2020-07-10 19:04:00,115 INFO L280 TraceCheckUtils]: 22: Hoare triple {3987#false} havoc #t~mem5.base, #t~mem5.offset; {3987#false} is VALID [2020-07-10 19:04:00,115 INFO L280 TraceCheckUtils]: 23: Hoare triple {3987#false} havoc #t~short7; {3987#false} is VALID [2020-07-10 19:04:00,115 INFO L280 TraceCheckUtils]: 24: Hoare triple {3987#false} goto; {3987#false} is VALID [2020-07-10 19:04:00,116 INFO L280 TraceCheckUtils]: 25: Hoare triple {3987#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3987#false} is VALID [2020-07-10 19:04:00,116 INFO L280 TraceCheckUtils]: 26: Hoare triple {3987#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3987#false} is VALID [2020-07-10 19:04:00,116 INFO L280 TraceCheckUtils]: 27: Hoare triple {3987#false} assume !(0 != #t~nondet8); {3987#false} is VALID [2020-07-10 19:04:00,117 INFO L280 TraceCheckUtils]: 28: Hoare triple {3987#false} havoc #t~nondet8; {3987#false} is VALID [2020-07-10 19:04:00,117 INFO L280 TraceCheckUtils]: 29: Hoare triple {3987#false} ~end~0.base, ~end~0.offset := 0, 0; {3987#false} is VALID [2020-07-10 19:04:00,117 INFO L280 TraceCheckUtils]: 30: Hoare triple {3987#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3987#false} is VALID [2020-07-10 19:04:00,117 INFO L280 TraceCheckUtils]: 31: Hoare triple {3987#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {3987#false} is VALID [2020-07-10 19:04:00,118 INFO L280 TraceCheckUtils]: 32: Hoare triple {3987#false} assume !false; {3987#false} is VALID [2020-07-10 19:04:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:00,120 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:00,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58665619] [2020-07-10 19:04:00,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:00,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:00,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016537240] [2020-07-10 19:04:00,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-10 19:04:00,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:00,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:00,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:00,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:00,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:00,178 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 6 states. [2020-07-10 19:04:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:02,165 INFO L93 Difference]: Finished difference Result 377 states and 399 transitions. [2020-07-10 19:04:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:04:02,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-10 19:04:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2020-07-10 19:04:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2020-07-10 19:04:02,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 399 transitions. [2020-07-10 19:04:02,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:02,628 INFO L225 Difference]: With dead ends: 377 [2020-07-10 19:04:02,628 INFO L226 Difference]: Without dead ends: 249 [2020-07-10 19:04:02,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-10 19:04:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 162. [2020-07-10 19:04:03,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:03,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 162 states. [2020-07-10 19:04:03,029 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 162 states. [2020-07-10 19:04:03,029 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 162 states. [2020-07-10 19:04:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:03,038 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2020-07-10 19:04:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2020-07-10 19:04:03,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:03,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:03,040 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 249 states. [2020-07-10 19:04:03,040 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 249 states. [2020-07-10 19:04:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:03,050 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2020-07-10 19:04:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2020-07-10 19:04:03,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:03,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:03,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:03,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-10 19:04:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2020-07-10 19:04:03,057 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 33 [2020-07-10 19:04:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:03,057 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2020-07-10 19:04:03,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:03,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 171 transitions. [2020-07-10 19:04:03,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2020-07-10 19:04:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 19:04:03,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:03,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:03,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:04:03,352 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash -820684573, now seen corresponding path program 1 times [2020-07-10 19:04:03,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:03,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177967336] [2020-07-10 19:04:03,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:03,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {5589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5579#true} is VALID [2020-07-10 19:04:03,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {5579#true} #valid := #valid[0 := 0]; {5579#true} is VALID [2020-07-10 19:04:03,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {5579#true} assume 0 < #StackHeapBarrier; {5579#true} is VALID [2020-07-10 19:04:03,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {5579#true} assume true; {5579#true} is VALID [2020-07-10 19:04:03,536 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5579#true} {5579#true} #414#return; {5579#true} is VALID [2020-07-10 19:04:03,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {5579#true} call ULTIMATE.init(); {5589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:03,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {5589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5579#true} is VALID [2020-07-10 19:04:03,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {5579#true} #valid := #valid[0 := 0]; {5579#true} is VALID [2020-07-10 19:04:03,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {5579#true} assume 0 < #StackHeapBarrier; {5579#true} is VALID [2020-07-10 19:04:03,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {5579#true} assume true; {5579#true} is VALID [2020-07-10 19:04:03,539 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5579#true} {5579#true} #414#return; {5579#true} is VALID [2020-07-10 19:04:03,540 INFO L263 TraceCheckUtils]: 6: Hoare triple {5579#true} call #t~ret28 := main(); {5579#true} is VALID [2020-07-10 19:04:03,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {5579#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {5586#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:03,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {5586#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {5587#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {5587#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {5587#(not (= 0 main_~list~0.base))} goto; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,571 INFO L280 TraceCheckUtils]: 15: Hoare triple {5587#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,572 INFO L280 TraceCheckUtils]: 16: Hoare triple {5587#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,572 INFO L280 TraceCheckUtils]: 17: Hoare triple {5587#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {5587#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume !#t~short7; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {5587#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,575 INFO L280 TraceCheckUtils]: 21: Hoare triple {5587#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,576 INFO L280 TraceCheckUtils]: 22: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,577 INFO L280 TraceCheckUtils]: 23: Hoare triple {5587#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,577 INFO L280 TraceCheckUtils]: 24: Hoare triple {5587#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {5587#(not (= 0 main_~list~0.base))} havoc #t~short7; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {5587#(not (= 0 main_~list~0.base))} goto; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,580 INFO L280 TraceCheckUtils]: 27: Hoare triple {5587#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,580 INFO L280 TraceCheckUtils]: 28: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,581 INFO L280 TraceCheckUtils]: 29: Hoare triple {5587#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,582 INFO L280 TraceCheckUtils]: 30: Hoare triple {5587#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,582 INFO L280 TraceCheckUtils]: 31: Hoare triple {5587#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5587#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:03,583 INFO L280 TraceCheckUtils]: 32: Hoare triple {5587#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5588#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:03,584 INFO L280 TraceCheckUtils]: 33: Hoare triple {5588#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5580#false} is VALID [2020-07-10 19:04:03,584 INFO L280 TraceCheckUtils]: 34: Hoare triple {5580#false} assume !false; {5580#false} is VALID [2020-07-10 19:04:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:03,587 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:03,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177967336] [2020-07-10 19:04:03,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:03,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:03,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601593885] [2020-07-10 19:04:03,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-10 19:04:03,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:03,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:03,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:03,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:03,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:03,635 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 6 states. [2020-07-10 19:04:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:05,331 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2020-07-10 19:04:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:04:05,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-10 19:04:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2020-07-10 19:04:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2020-07-10 19:04:05,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 282 transitions. [2020-07-10 19:04:05,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:05,748 INFO L225 Difference]: With dead ends: 270 [2020-07-10 19:04:05,748 INFO L226 Difference]: Without dead ends: 238 [2020-07-10 19:04:05,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-10 19:04:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 161. [2020-07-10 19:04:06,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:06,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 161 states. [2020-07-10 19:04:06,187 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 161 states. [2020-07-10 19:04:06,187 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 161 states. [2020-07-10 19:04:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:06,195 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2020-07-10 19:04:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 251 transitions. [2020-07-10 19:04:06,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:06,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:06,201 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 238 states. [2020-07-10 19:04:06,201 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 238 states. [2020-07-10 19:04:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:06,211 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2020-07-10 19:04:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 251 transitions. [2020-07-10 19:04:06,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:06,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:06,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:06,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-10 19:04:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2020-07-10 19:04:06,217 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 35 [2020-07-10 19:04:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:06,217 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2020-07-10 19:04:06,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:06,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 170 transitions. [2020-07-10 19:04:06,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2020-07-10 19:04:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 19:04:06,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:06,505 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] [2020-07-10 19:04:06,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:04:06,506 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2091807586, now seen corresponding path program 1 times [2020-07-10 19:04:06,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:06,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855427454] [2020-07-10 19:04:06,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:06,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {6950#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6934#true} is VALID [2020-07-10 19:04:06,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {6934#true} #valid := #valid[0 := 0]; {6934#true} is VALID [2020-07-10 19:04:06,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {6934#true} assume 0 < #StackHeapBarrier; {6934#true} is VALID [2020-07-10 19:04:06,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {6934#true} assume true; {6934#true} is VALID [2020-07-10 19:04:06,792 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6934#true} {6934#true} #414#return; {6934#true} is VALID [2020-07-10 19:04:06,802 INFO L263 TraceCheckUtils]: 0: Hoare triple {6934#true} call ULTIMATE.init(); {6950#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:06,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {6950#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6934#true} is VALID [2020-07-10 19:04:06,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {6934#true} #valid := #valid[0 := 0]; {6934#true} is VALID [2020-07-10 19:04:06,803 INFO L280 TraceCheckUtils]: 3: Hoare triple {6934#true} assume 0 < #StackHeapBarrier; {6934#true} is VALID [2020-07-10 19:04:06,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {6934#true} assume true; {6934#true} is VALID [2020-07-10 19:04:06,804 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6934#true} {6934#true} #414#return; {6934#true} is VALID [2020-07-10 19:04:06,804 INFO L263 TraceCheckUtils]: 6: Hoare triple {6934#true} call #t~ret28 := main(); {6934#true} is VALID [2020-07-10 19:04:06,806 INFO L280 TraceCheckUtils]: 7: Hoare triple {6934#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {6941#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:06,807 INFO L280 TraceCheckUtils]: 8: Hoare triple {6941#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,808 INFO L280 TraceCheckUtils]: 10: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,809 INFO L280 TraceCheckUtils]: 11: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,809 INFO L280 TraceCheckUtils]: 12: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} goto; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,810 INFO L280 TraceCheckUtils]: 13: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,810 INFO L280 TraceCheckUtils]: 14: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} assume 0 != #t~nondet1; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,811 INFO L280 TraceCheckUtils]: 15: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,811 INFO L280 TraceCheckUtils]: 16: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,813 INFO L280 TraceCheckUtils]: 18: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,814 INFO L280 TraceCheckUtils]: 19: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} assume !#t~short7; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,814 INFO L280 TraceCheckUtils]: 20: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,815 INFO L280 TraceCheckUtils]: 21: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} assume !!#t~short7; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,817 INFO L280 TraceCheckUtils]: 23: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,818 INFO L280 TraceCheckUtils]: 24: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,820 INFO L280 TraceCheckUtils]: 25: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} havoc #t~short7; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,821 INFO L280 TraceCheckUtils]: 26: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} goto; {6942#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:04:06,821 INFO L280 TraceCheckUtils]: 27: Hoare triple {6942#(= 1 (select |#valid| main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6943#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-10 19:04:06,822 INFO L280 TraceCheckUtils]: 28: Hoare triple {6943#(= 1 (select |#valid| main_~end~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6943#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-10 19:04:06,824 INFO L280 TraceCheckUtils]: 29: Hoare triple {6943#(= 1 (select |#valid| main_~end~0.base))} assume !!(0 != #t~nondet8); {6943#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-10 19:04:06,826 INFO L280 TraceCheckUtils]: 30: Hoare triple {6943#(= 1 (select |#valid| main_~end~0.base))} havoc #t~nondet8; {6943#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-10 19:04:06,827 INFO L280 TraceCheckUtils]: 31: Hoare triple {6943#(= 1 (select |#valid| main_~end~0.base))} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12); srcloc: L1003 {6944#(and (not (= 0 |main_#t~malloc9.base|)) (not (= |main_#t~malloc9.base| main_~end~0.base)))} is VALID [2020-07-10 19:04:06,827 INFO L280 TraceCheckUtils]: 32: Hoare triple {6944#(and (not (= 0 |main_#t~malloc9.base|)) (not (= |main_#t~malloc9.base| main_~end~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1003-1 {6945#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)))} is VALID [2020-07-10 19:04:06,828 INFO L280 TraceCheckUtils]: 33: Hoare triple {6945#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1003-2 {6946#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= |main_#t~mem10.base| main_~end~0.base)))} is VALID [2020-07-10 19:04:06,829 INFO L280 TraceCheckUtils]: 34: Hoare triple {6946#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= |main_#t~mem10.base| main_~end~0.base)))} SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4); srcloc: L1004 {6947#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:04:06,830 INFO L280 TraceCheckUtils]: 35: Hoare triple {6947#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem10.base, #t~mem10.offset; {6947#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:04:06,830 INFO L280 TraceCheckUtils]: 36: Hoare triple {6947#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005 {6948#(not (= 0 |main_#t~mem11.base|))} is VALID [2020-07-10 19:04:06,831 INFO L280 TraceCheckUtils]: 37: Hoare triple {6948#(not (= 0 |main_#t~mem11.base|))} ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; {6949#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:06,832 INFO L280 TraceCheckUtils]: 38: Hoare triple {6949#(not (= 0 main_~end~0.base))} havoc #t~mem11.base, #t~mem11.offset; {6949#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:06,833 INFO L280 TraceCheckUtils]: 39: Hoare triple {6949#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1006 {6949#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:06,834 INFO L280 TraceCheckUtils]: 40: Hoare triple {6949#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6935#false} is VALID [2020-07-10 19:04:06,834 INFO L280 TraceCheckUtils]: 41: Hoare triple {6935#false} assume !false; {6935#false} is VALID [2020-07-10 19:04:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:06,838 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:06,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855427454] [2020-07-10 19:04:06,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:06,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 19:04:06,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546032906] [2020-07-10 19:04:06,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-07-10 19:04:06,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:06,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 19:04:06,909 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-10 19:04:06,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 19:04:06,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 19:04:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:04:06,910 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 12 states. [2020-07-10 19:04:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:10,840 INFO L93 Difference]: Finished difference Result 286 states and 302 transitions. [2020-07-10 19:04:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 19:04:10,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-07-10 19:04:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:04:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 299 transitions. [2020-07-10 19:04:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:04:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 299 transitions. [2020-07-10 19:04:10,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 299 transitions. [2020-07-10 19:04:11,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:11,292 INFO L225 Difference]: With dead ends: 286 [2020-07-10 19:04:11,292 INFO L226 Difference]: Without dead ends: 282 [2020-07-10 19:04:11,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-07-10 19:04:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-10 19:04:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 176. [2020-07-10 19:04:11,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:11,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 176 states. [2020-07-10 19:04:11,970 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 176 states. [2020-07-10 19:04:11,970 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 176 states. [2020-07-10 19:04:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:11,978 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2020-07-10 19:04:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 298 transitions. [2020-07-10 19:04:11,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:11,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:11,980 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 282 states. [2020-07-10 19:04:11,980 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 282 states. [2020-07-10 19:04:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:11,988 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2020-07-10 19:04:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 298 transitions. [2020-07-10 19:04:11,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:11,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:11,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:11,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-10 19:04:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2020-07-10 19:04:11,994 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 42 [2020-07-10 19:04:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:11,994 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2020-07-10 19:04:11,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 19:04:11,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 176 states and 186 transitions. [2020-07-10 19:04:12,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2020-07-10 19:04:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 19:04:12,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:12,413 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] [2020-07-10 19:04:12,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:04:12,413 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash 654436304, now seen corresponding path program 1 times [2020-07-10 19:04:12,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:12,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122845823] [2020-07-10 19:04:12,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:12,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {8465#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8457#true} is VALID [2020-07-10 19:04:12,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {8457#true} #valid := #valid[0 := 0]; {8457#true} is VALID [2020-07-10 19:04:12,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {8457#true} assume 0 < #StackHeapBarrier; {8457#true} is VALID [2020-07-10 19:04:12,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {8457#true} assume true; {8457#true} is VALID [2020-07-10 19:04:12,506 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8457#true} {8457#true} #414#return; {8457#true} is VALID [2020-07-10 19:04:12,507 INFO L263 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8465#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:12,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {8465#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8457#true} is VALID [2020-07-10 19:04:12,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {8457#true} #valid := #valid[0 := 0]; {8457#true} is VALID [2020-07-10 19:04:12,508 INFO L280 TraceCheckUtils]: 3: Hoare triple {8457#true} assume 0 < #StackHeapBarrier; {8457#true} is VALID [2020-07-10 19:04:12,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {8457#true} assume true; {8457#true} is VALID [2020-07-10 19:04:12,508 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8457#true} {8457#true} #414#return; {8457#true} is VALID [2020-07-10 19:04:12,508 INFO L263 TraceCheckUtils]: 6: Hoare triple {8457#true} call #t~ret28 := main(); {8457#true} is VALID [2020-07-10 19:04:12,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {8457#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {8457#true} is VALID [2020-07-10 19:04:12,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {8457#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8457#true} is VALID [2020-07-10 19:04:12,509 INFO L280 TraceCheckUtils]: 9: Hoare triple {8457#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {8457#true} is VALID [2020-07-10 19:04:12,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {8457#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {8457#true} is VALID [2020-07-10 19:04:12,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {8457#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8457#true} is VALID [2020-07-10 19:04:12,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {8457#true} goto; {8457#true} is VALID [2020-07-10 19:04:12,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {8457#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8457#true} is VALID [2020-07-10 19:04:12,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {8457#true} assume 0 != #t~nondet1; {8457#true} is VALID [2020-07-10 19:04:12,511 INFO L280 TraceCheckUtils]: 15: Hoare triple {8457#true} havoc #t~nondet1; {8457#true} is VALID [2020-07-10 19:04:12,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {8457#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {8457#true} is VALID [2020-07-10 19:04:12,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {8457#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {8457#true} is VALID [2020-07-10 19:04:12,512 INFO L280 TraceCheckUtils]: 18: Hoare triple {8457#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8457#true} is VALID [2020-07-10 19:04:12,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {8457#true} assume !#t~short7; {8457#true} is VALID [2020-07-10 19:04:12,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {8457#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {8457#true} is VALID [2020-07-10 19:04:12,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {8457#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8457#true} is VALID [2020-07-10 19:04:12,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {8457#true} assume !!#t~short7; {8457#true} is VALID [2020-07-10 19:04:12,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {8457#true} havoc #t~mem6.base, #t~mem6.offset; {8457#true} is VALID [2020-07-10 19:04:12,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {8457#true} havoc #t~mem5.base, #t~mem5.offset; {8457#true} is VALID [2020-07-10 19:04:12,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {8457#true} havoc #t~short7; {8457#true} is VALID [2020-07-10 19:04:12,514 INFO L280 TraceCheckUtils]: 26: Hoare triple {8457#true} goto; {8457#true} is VALID [2020-07-10 19:04:12,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {8457#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8457#true} is VALID [2020-07-10 19:04:12,514 INFO L280 TraceCheckUtils]: 28: Hoare triple {8457#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8457#true} is VALID [2020-07-10 19:04:12,514 INFO L280 TraceCheckUtils]: 29: Hoare triple {8457#true} assume !(0 != #t~nondet8); {8457#true} is VALID [2020-07-10 19:04:12,515 INFO L280 TraceCheckUtils]: 30: Hoare triple {8457#true} havoc #t~nondet8; {8457#true} is VALID [2020-07-10 19:04:12,515 INFO L280 TraceCheckUtils]: 31: Hoare triple {8457#true} ~end~0.base, ~end~0.offset := 0, 0; {8457#true} is VALID [2020-07-10 19:04:12,515 INFO L280 TraceCheckUtils]: 32: Hoare triple {8457#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8457#true} is VALID [2020-07-10 19:04:12,516 INFO L280 TraceCheckUtils]: 33: Hoare triple {8457#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8457#true} is VALID [2020-07-10 19:04:12,516 INFO L280 TraceCheckUtils]: 34: Hoare triple {8457#true} goto; {8457#true} is VALID [2020-07-10 19:04:12,516 INFO L280 TraceCheckUtils]: 35: Hoare triple {8457#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8457#true} is VALID [2020-07-10 19:04:12,517 INFO L280 TraceCheckUtils]: 36: Hoare triple {8457#true} ~len~0 := 0; {8464#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:12,518 INFO L280 TraceCheckUtils]: 37: Hoare triple {8464#(= 0 main_~len~0)} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {8464#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:12,518 INFO L280 TraceCheckUtils]: 38: Hoare triple {8464#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {8464#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:12,519 INFO L280 TraceCheckUtils]: 39: Hoare triple {8464#(= 0 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {8464#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:12,520 INFO L280 TraceCheckUtils]: 40: Hoare triple {8464#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8464#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:12,521 INFO L280 TraceCheckUtils]: 41: Hoare triple {8464#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8458#false} is VALID [2020-07-10 19:04:12,521 INFO L280 TraceCheckUtils]: 42: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2020-07-10 19:04:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:12,523 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:12,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122845823] [2020-07-10 19:04:12,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:12,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:12,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604008910] [2020-07-10 19:04:12,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-10 19:04:12,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:12,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:12,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:12,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:12,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:12,577 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 4 states. [2020-07-10 19:04:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:14,093 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2020-07-10 19:04:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:14,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-10 19:04:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2020-07-10 19:04:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2020-07-10 19:04:14,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 281 transitions. [2020-07-10 19:04:14,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:14,413 INFO L225 Difference]: With dead ends: 282 [2020-07-10 19:04:14,413 INFO L226 Difference]: Without dead ends: 215 [2020-07-10 19:04:14,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-07-10 19:04:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2020-07-10 19:04:15,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:15,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand 179 states. [2020-07-10 19:04:15,100 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 179 states. [2020-07-10 19:04:15,100 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 179 states. [2020-07-10 19:04:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:15,105 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-10 19:04:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2020-07-10 19:04:15,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:15,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:15,106 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 215 states. [2020-07-10 19:04:15,106 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 215 states. [2020-07-10 19:04:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:15,111 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-10 19:04:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2020-07-10 19:04:15,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:15,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:15,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:15,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-07-10 19:04:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2020-07-10 19:04:15,116 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 43 [2020-07-10 19:04:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:15,117 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2020-07-10 19:04:15,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:15,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 179 states and 190 transitions. [2020-07-10 19:04:15,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2020-07-10 19:04:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 19:04:15,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:15,537 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-10 19:04:15,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:04:15,537 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1847672787, now seen corresponding path program 1 times [2020-07-10 19:04:15,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:15,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224072595] [2020-07-10 19:04:15,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:15,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {9828#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9820#true} is VALID [2020-07-10 19:04:15,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {9820#true} #valid := #valid[0 := 0]; {9820#true} is VALID [2020-07-10 19:04:15,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {9820#true} assume 0 < #StackHeapBarrier; {9820#true} is VALID [2020-07-10 19:04:15,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {9820#true} assume true; {9820#true} is VALID [2020-07-10 19:04:15,648 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9820#true} {9820#true} #414#return; {9820#true} is VALID [2020-07-10 19:04:15,653 INFO L263 TraceCheckUtils]: 0: Hoare triple {9820#true} call ULTIMATE.init(); {9828#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:15,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {9828#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9820#true} is VALID [2020-07-10 19:04:15,654 INFO L280 TraceCheckUtils]: 2: Hoare triple {9820#true} #valid := #valid[0 := 0]; {9820#true} is VALID [2020-07-10 19:04:15,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {9820#true} assume 0 < #StackHeapBarrier; {9820#true} is VALID [2020-07-10 19:04:15,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {9820#true} assume true; {9820#true} is VALID [2020-07-10 19:04:15,655 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9820#true} {9820#true} #414#return; {9820#true} is VALID [2020-07-10 19:04:15,655 INFO L263 TraceCheckUtils]: 6: Hoare triple {9820#true} call #t~ret28 := main(); {9820#true} is VALID [2020-07-10 19:04:15,655 INFO L280 TraceCheckUtils]: 7: Hoare triple {9820#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {9820#true} is VALID [2020-07-10 19:04:15,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {9820#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9820#true} is VALID [2020-07-10 19:04:15,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {9820#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {9820#true} is VALID [2020-07-10 19:04:15,656 INFO L280 TraceCheckUtils]: 10: Hoare triple {9820#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {9820#true} is VALID [2020-07-10 19:04:15,656 INFO L280 TraceCheckUtils]: 11: Hoare triple {9820#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9820#true} is VALID [2020-07-10 19:04:15,656 INFO L280 TraceCheckUtils]: 12: Hoare triple {9820#true} goto; {9820#true} is VALID [2020-07-10 19:04:15,657 INFO L280 TraceCheckUtils]: 13: Hoare triple {9820#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9820#true} is VALID [2020-07-10 19:04:15,657 INFO L280 TraceCheckUtils]: 14: Hoare triple {9820#true} assume 0 != #t~nondet1; {9820#true} is VALID [2020-07-10 19:04:15,657 INFO L280 TraceCheckUtils]: 15: Hoare triple {9820#true} havoc #t~nondet1; {9820#true} is VALID [2020-07-10 19:04:15,657 INFO L280 TraceCheckUtils]: 16: Hoare triple {9820#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {9820#true} is VALID [2020-07-10 19:04:15,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {9820#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {9820#true} is VALID [2020-07-10 19:04:15,658 INFO L280 TraceCheckUtils]: 18: Hoare triple {9820#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9820#true} is VALID [2020-07-10 19:04:15,658 INFO L280 TraceCheckUtils]: 19: Hoare triple {9820#true} assume !#t~short7; {9820#true} is VALID [2020-07-10 19:04:15,658 INFO L280 TraceCheckUtils]: 20: Hoare triple {9820#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {9820#true} is VALID [2020-07-10 19:04:15,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {9820#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9820#true} is VALID [2020-07-10 19:04:15,659 INFO L280 TraceCheckUtils]: 22: Hoare triple {9820#true} assume !!#t~short7; {9820#true} is VALID [2020-07-10 19:04:15,659 INFO L280 TraceCheckUtils]: 23: Hoare triple {9820#true} havoc #t~mem6.base, #t~mem6.offset; {9820#true} is VALID [2020-07-10 19:04:15,659 INFO L280 TraceCheckUtils]: 24: Hoare triple {9820#true} havoc #t~mem5.base, #t~mem5.offset; {9820#true} is VALID [2020-07-10 19:04:15,659 INFO L280 TraceCheckUtils]: 25: Hoare triple {9820#true} havoc #t~short7; {9820#true} is VALID [2020-07-10 19:04:15,659 INFO L280 TraceCheckUtils]: 26: Hoare triple {9820#true} goto; {9820#true} is VALID [2020-07-10 19:04:15,660 INFO L280 TraceCheckUtils]: 27: Hoare triple {9820#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9820#true} is VALID [2020-07-10 19:04:15,660 INFO L280 TraceCheckUtils]: 28: Hoare triple {9820#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9820#true} is VALID [2020-07-10 19:04:15,660 INFO L280 TraceCheckUtils]: 29: Hoare triple {9820#true} assume !(0 != #t~nondet8); {9820#true} is VALID [2020-07-10 19:04:15,660 INFO L280 TraceCheckUtils]: 30: Hoare triple {9820#true} havoc #t~nondet8; {9820#true} is VALID [2020-07-10 19:04:15,661 INFO L280 TraceCheckUtils]: 31: Hoare triple {9820#true} ~end~0.base, ~end~0.offset := 0, 0; {9820#true} is VALID [2020-07-10 19:04:15,661 INFO L280 TraceCheckUtils]: 32: Hoare triple {9820#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9820#true} is VALID [2020-07-10 19:04:15,661 INFO L280 TraceCheckUtils]: 33: Hoare triple {9820#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9820#true} is VALID [2020-07-10 19:04:15,661 INFO L280 TraceCheckUtils]: 34: Hoare triple {9820#true} goto; {9820#true} is VALID [2020-07-10 19:04:15,664 INFO L280 TraceCheckUtils]: 35: Hoare triple {9820#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9820#true} is VALID [2020-07-10 19:04:15,665 INFO L280 TraceCheckUtils]: 36: Hoare triple {9820#true} ~len~0 := 0; {9820#true} is VALID [2020-07-10 19:04:15,665 INFO L280 TraceCheckUtils]: 37: Hoare triple {9820#true} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {9820#true} is VALID [2020-07-10 19:04:15,665 INFO L280 TraceCheckUtils]: 38: Hoare triple {9820#true} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {9820#true} is VALID [2020-07-10 19:04:15,665 INFO L280 TraceCheckUtils]: 39: Hoare triple {9820#true} havoc #t~mem19.base, #t~mem19.offset; {9820#true} is VALID [2020-07-10 19:04:15,667 INFO L280 TraceCheckUtils]: 40: Hoare triple {9820#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9827#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 19:04:15,669 INFO L280 TraceCheckUtils]: 41: Hoare triple {9827#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9827#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 19:04:15,669 INFO L280 TraceCheckUtils]: 42: Hoare triple {9827#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9827#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 19:04:15,670 INFO L280 TraceCheckUtils]: 43: Hoare triple {9827#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9821#false} is VALID [2020-07-10 19:04:15,671 INFO L280 TraceCheckUtils]: 44: Hoare triple {9821#false} assume !false; {9821#false} is VALID [2020-07-10 19:04:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:15,674 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:15,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224072595] [2020-07-10 19:04:15,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:15,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:15,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168324912] [2020-07-10 19:04:15,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-07-10 19:04:15,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:15,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:15,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:15,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:15,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:15,756 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2020-07-10 19:04:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:17,047 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2020-07-10 19:04:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:17,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-07-10 19:04:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2020-07-10 19:04:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2020-07-10 19:04:17,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2020-07-10 19:04:17,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:17,257 INFO L225 Difference]: With dead ends: 179 [2020-07-10 19:04:17,257 INFO L226 Difference]: Without dead ends: 177 [2020-07-10 19:04:17,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-10 19:04:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-07-10 19:04:18,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:18,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 177 states. [2020-07-10 19:04:18,002 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2020-07-10 19:04:18,002 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2020-07-10 19:04:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:18,007 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2020-07-10 19:04:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-10 19:04:18,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:18,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:18,009 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2020-07-10 19:04:18,009 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2020-07-10 19:04:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:18,013 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2020-07-10 19:04:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-10 19:04:18,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:18,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:18,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:18,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-10 19:04:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2020-07-10 19:04:18,019 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 45 [2020-07-10 19:04:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:18,019 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2020-07-10 19:04:18,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:18,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 188 transitions. [2020-07-10 19:04:18,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-10 19:04:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 19:04:18,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:18,425 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, 1, 1, 1, 1] [2020-07-10 19:04:18,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 19:04:18,425 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 11890970, now seen corresponding path program 1 times [2020-07-10 19:04:18,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:18,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2010620832] [2020-07-10 19:04:18,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:18,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {10912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10897#true} is VALID [2020-07-10 19:04:18,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {10897#true} #valid := #valid[0 := 0]; {10897#true} is VALID [2020-07-10 19:04:18,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {10897#true} assume 0 < #StackHeapBarrier; {10897#true} is VALID [2020-07-10 19:04:18,745 INFO L280 TraceCheckUtils]: 3: Hoare triple {10897#true} assume true; {10897#true} is VALID [2020-07-10 19:04:18,746 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10897#true} {10897#true} #414#return; {10897#true} is VALID [2020-07-10 19:04:18,747 INFO L263 TraceCheckUtils]: 0: Hoare triple {10897#true} call ULTIMATE.init(); {10912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:18,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {10912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10897#true} is VALID [2020-07-10 19:04:18,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {10897#true} #valid := #valid[0 := 0]; {10897#true} is VALID [2020-07-10 19:04:18,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {10897#true} assume 0 < #StackHeapBarrier; {10897#true} is VALID [2020-07-10 19:04:18,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {10897#true} assume true; {10897#true} is VALID [2020-07-10 19:04:18,749 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10897#true} {10897#true} #414#return; {10897#true} is VALID [2020-07-10 19:04:18,749 INFO L263 TraceCheckUtils]: 6: Hoare triple {10897#true} call #t~ret28 := main(); {10897#true} is VALID [2020-07-10 19:04:18,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {10897#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {10904#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:18,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {10904#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {10905#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {10905#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {10905#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {10905#(= 0 main_~list~0.offset)} goto; {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {10905#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {10905#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,758 INFO L280 TraceCheckUtils]: 15: Hoare triple {10905#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {10905#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {10905#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:18,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {10905#(= 0 main_~list~0.offset)} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {10906#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:18,761 INFO L280 TraceCheckUtils]: 18: Hoare triple {10906#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {10907#(or |main_#t~short7| (and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-10 19:04:18,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {10907#(or |main_#t~short7| (and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,764 INFO L280 TraceCheckUtils]: 20: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,765 INFO L280 TraceCheckUtils]: 21: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,766 INFO L280 TraceCheckUtils]: 22: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,768 INFO L280 TraceCheckUtils]: 23: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem6.base, #t~mem6.offset; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,769 INFO L280 TraceCheckUtils]: 24: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem5.base, #t~mem5.offset; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,770 INFO L280 TraceCheckUtils]: 25: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~short7; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,772 INFO L280 TraceCheckUtils]: 26: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,773 INFO L280 TraceCheckUtils]: 27: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,775 INFO L280 TraceCheckUtils]: 28: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,776 INFO L280 TraceCheckUtils]: 29: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8); {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,777 INFO L280 TraceCheckUtils]: 30: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~nondet8; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,778 INFO L280 TraceCheckUtils]: 31: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0; {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:18,779 INFO L280 TraceCheckUtils]: 32: Hoare triple {10908#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:18,780 INFO L280 TraceCheckUtils]: 33: Hoare triple {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:18,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} goto; {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:18,782 INFO L280 TraceCheckUtils]: 35: Hoare triple {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:18,783 INFO L280 TraceCheckUtils]: 36: Hoare triple {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} ~len~0 := 0; {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:18,784 INFO L280 TraceCheckUtils]: 37: Hoare triple {10909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {10910#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-10 19:04:18,784 INFO L280 TraceCheckUtils]: 38: Hoare triple {10910#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {10911#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-10 19:04:18,785 INFO L280 TraceCheckUtils]: 39: Hoare triple {10911#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem19.base, #t~mem19.offset; {10911#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-10 19:04:18,786 INFO L280 TraceCheckUtils]: 40: Hoare triple {10911#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10898#false} is VALID [2020-07-10 19:04:18,786 INFO L280 TraceCheckUtils]: 41: Hoare triple {10898#false} assume 0 == ~len~0; {10898#false} is VALID [2020-07-10 19:04:18,786 INFO L280 TraceCheckUtils]: 42: Hoare triple {10898#false} ~len~0 := 1; {10898#false} is VALID [2020-07-10 19:04:18,787 INFO L280 TraceCheckUtils]: 43: Hoare triple {10898#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10898#false} is VALID [2020-07-10 19:04:18,787 INFO L280 TraceCheckUtils]: 44: Hoare triple {10898#false} goto; {10898#false} is VALID [2020-07-10 19:04:18,787 INFO L280 TraceCheckUtils]: 45: Hoare triple {10898#false} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); srcloc: L1028-6 {10898#false} is VALID [2020-07-10 19:04:18,787 INFO L280 TraceCheckUtils]: 46: Hoare triple {10898#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {10898#false} is VALID [2020-07-10 19:04:18,788 INFO L280 TraceCheckUtils]: 47: Hoare triple {10898#false} havoc #t~mem20.base, #t~mem20.offset; {10898#false} is VALID [2020-07-10 19:04:18,788 INFO L280 TraceCheckUtils]: 48: Hoare triple {10898#false} assume !false; {10898#false} is VALID [2020-07-10 19:04:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:18,799 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:18,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2010620832] [2020-07-10 19:04:18,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:18,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 19:04:18,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846184284] [2020-07-10 19:04:18,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-10 19:04:18,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:18,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 19:04:18,873 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-10 19:04:18,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 19:04:18,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 19:04:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-10 19:04:18,874 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 11 states. [2020-07-10 19:04:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:23,333 INFO L93 Difference]: Finished difference Result 374 states and 398 transitions. [2020-07-10 19:04:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 19:04:23,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-10 19:04:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 19:04:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 370 transitions. [2020-07-10 19:04:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 19:04:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 370 transitions. [2020-07-10 19:04:23,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 370 transitions. [2020-07-10 19:04:23,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:23,851 INFO L225 Difference]: With dead ends: 374 [2020-07-10 19:04:23,851 INFO L226 Difference]: Without dead ends: 306 [2020-07-10 19:04:23,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2020-07-10 19:04:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-07-10 19:04:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 196. [2020-07-10 19:04:24,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:24,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 196 states. [2020-07-10 19:04:24,895 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 196 states. [2020-07-10 19:04:24,895 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 196 states. [2020-07-10 19:04:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:24,903 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2020-07-10 19:04:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2020-07-10 19:04:24,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:24,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:24,905 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 306 states. [2020-07-10 19:04:24,905 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 306 states. [2020-07-10 19:04:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:24,913 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2020-07-10 19:04:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2020-07-10 19:04:24,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:24,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:24,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:24,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-07-10 19:04:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2020-07-10 19:04:24,919 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 49 [2020-07-10 19:04:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:24,919 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2020-07-10 19:04:24,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 19:04:24,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 196 states and 208 transitions. [2020-07-10 19:04:25,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2020-07-10 19:04:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 19:04:25,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:25,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:25,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 19:04:25,413 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1643041774, now seen corresponding path program 1 times [2020-07-10 19:04:25,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:25,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2134231263] [2020-07-10 19:04:25,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:26,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {12711#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12693#true} is VALID [2020-07-10 19:04:26,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {12693#true} #valid := #valid[0 := 0]; {12693#true} is VALID [2020-07-10 19:04:26,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {12693#true} assume 0 < #StackHeapBarrier; {12693#true} is VALID [2020-07-10 19:04:26,026 INFO L280 TraceCheckUtils]: 3: Hoare triple {12693#true} assume true; {12693#true} is VALID [2020-07-10 19:04:26,026 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12693#true} {12693#true} #414#return; {12693#true} is VALID [2020-07-10 19:04:26,027 INFO L263 TraceCheckUtils]: 0: Hoare triple {12693#true} call ULTIMATE.init(); {12711#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:26,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {12711#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12693#true} is VALID [2020-07-10 19:04:26,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {12693#true} #valid := #valid[0 := 0]; {12693#true} is VALID [2020-07-10 19:04:26,028 INFO L280 TraceCheckUtils]: 3: Hoare triple {12693#true} assume 0 < #StackHeapBarrier; {12693#true} is VALID [2020-07-10 19:04:26,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {12693#true} assume true; {12693#true} is VALID [2020-07-10 19:04:26,028 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12693#true} {12693#true} #414#return; {12693#true} is VALID [2020-07-10 19:04:26,028 INFO L263 TraceCheckUtils]: 6: Hoare triple {12693#true} call #t~ret28 := main(); {12693#true} is VALID [2020-07-10 19:04:26,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {12693#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {12700#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-10 19:04:26,030 INFO L280 TraceCheckUtils]: 8: Hoare triple {12700#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,032 INFO L280 TraceCheckUtils]: 10: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1); {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,038 INFO L280 TraceCheckUtils]: 15: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} havoc #t~nondet1; {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,039 INFO L280 TraceCheckUtils]: 16: Hoare triple {12701#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L995-10 {12702#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,040 INFO L280 TraceCheckUtils]: 17: Hoare triple {12702#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-11 {12703#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} is VALID [2020-07-10 19:04:26,050 INFO L280 TraceCheckUtils]: 18: Hoare triple {12703#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-12 {12704#(and (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem3.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-10 19:04:26,051 INFO L280 TraceCheckUtils]: 19: Hoare triple {12704#(and (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem3.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L995-13 {12703#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} is VALID [2020-07-10 19:04:26,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {12703#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} havoc #t~mem3.base, #t~mem3.offset; {12703#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} is VALID [2020-07-10 19:04:26,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {12703#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-15 {12705#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem4.base|))} is VALID [2020-07-10 19:04:26,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {12705#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4); srcloc: L995-16 {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,062 INFO L280 TraceCheckUtils]: 23: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem4.base, #t~mem4.offset; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,063 INFO L280 TraceCheckUtils]: 24: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,065 INFO L280 TraceCheckUtils]: 25: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,066 INFO L280 TraceCheckUtils]: 26: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume #t~short7; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,067 INFO L280 TraceCheckUtils]: 27: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,068 INFO L280 TraceCheckUtils]: 28: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem6.base, #t~mem6.offset; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,069 INFO L280 TraceCheckUtils]: 29: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem5.base, #t~mem5.offset; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,070 INFO L280 TraceCheckUtils]: 30: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~short7; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,071 INFO L280 TraceCheckUtils]: 31: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,072 INFO L280 TraceCheckUtils]: 32: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,073 INFO L280 TraceCheckUtils]: 33: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,074 INFO L280 TraceCheckUtils]: 34: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8); {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,075 INFO L280 TraceCheckUtils]: 35: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~nondet8; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,076 INFO L280 TraceCheckUtils]: 36: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0; {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:26,082 INFO L280 TraceCheckUtils]: 37: Hoare triple {12706#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 19:04:26,083 INFO L280 TraceCheckUtils]: 38: Hoare triple {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 19:04:26,084 INFO L280 TraceCheckUtils]: 39: Hoare triple {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 19:04:26,085 INFO L280 TraceCheckUtils]: 40: Hoare triple {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 19:04:26,086 INFO L280 TraceCheckUtils]: 41: Hoare triple {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} ~len~0 := 0; {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 19:04:26,087 INFO L280 TraceCheckUtils]: 42: Hoare triple {12707#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {12708#(and (= (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 8) 0) (= 0 |main_#t~mem19.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 8)))} is VALID [2020-07-10 19:04:26,089 INFO L280 TraceCheckUtils]: 43: Hoare triple {12708#(and (= (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 8) 0) (= 0 |main_#t~mem19.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 8)))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,089 INFO L280 TraceCheckUtils]: 44: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} havoc #t~mem19.base, #t~mem19.offset; {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,090 INFO L280 TraceCheckUtils]: 45: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,091 INFO L280 TraceCheckUtils]: 46: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume 0 == ~len~0; {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,092 INFO L280 TraceCheckUtils]: 47: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} ~len~0 := 1; {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,093 INFO L280 TraceCheckUtils]: 48: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,094 INFO L280 TraceCheckUtils]: 49: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} goto; {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 19:04:26,095 INFO L280 TraceCheckUtils]: 50: Hoare triple {12709#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); srcloc: L1028-6 {12710#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-10 19:04:26,095 INFO L280 TraceCheckUtils]: 51: Hoare triple {12710#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {12694#false} is VALID [2020-07-10 19:04:26,096 INFO L280 TraceCheckUtils]: 52: Hoare triple {12694#false} havoc #t~mem20.base, #t~mem20.offset; {12694#false} is VALID [2020-07-10 19:04:26,096 INFO L280 TraceCheckUtils]: 53: Hoare triple {12694#false} assume !false; {12694#false} is VALID [2020-07-10 19:04:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:26,116 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:26,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2134231263] [2020-07-10 19:04:26,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:04:26,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384877167] [2020-07-10 19:04:26,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-10 19:04:26,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:26,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:04:26,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:26,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:04:26,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:04:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:04:26,201 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 14 states. [2020-07-10 19:04:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:38,210 INFO L93 Difference]: Finished difference Result 589 states and 622 transitions. [2020-07-10 19:04:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 19:04:38,210 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-10 19:04:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 551 transitions. [2020-07-10 19:04:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 551 transitions. [2020-07-10 19:04:38,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 551 transitions. [2020-07-10 19:04:39,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:39,302 INFO L225 Difference]: With dead ends: 589 [2020-07-10 19:04:39,302 INFO L226 Difference]: Without dead ends: 586 [2020-07-10 19:04:39,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 19:04:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-07-10 19:04:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 213. [2020-07-10 19:04:40,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:40,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 213 states. [2020-07-10 19:04:40,932 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 213 states. [2020-07-10 19:04:40,932 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 213 states. [2020-07-10 19:04:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:40,956 INFO L93 Difference]: Finished difference Result 586 states and 619 transitions. [2020-07-10 19:04:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 619 transitions. [2020-07-10 19:04:40,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:40,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:40,959 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 586 states. [2020-07-10 19:04:40,959 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 586 states. [2020-07-10 19:04:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:40,984 INFO L93 Difference]: Finished difference Result 586 states and 619 transitions. [2020-07-10 19:04:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 619 transitions. [2020-07-10 19:04:40,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:40,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:40,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:40,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-10 19:04:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2020-07-10 19:04:40,991 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 54 [2020-07-10 19:04:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:40,992 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2020-07-10 19:04:40,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:04:40,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 213 states and 226 transitions. [2020-07-10 19:04:41,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2020-07-10 19:04:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 19:04:41,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:41,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:41,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 19:04:41,795 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 358720869, now seen corresponding path program 1 times [2020-07-10 19:04:41,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:41,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [401081819] [2020-07-10 19:04:41,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:42,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {15540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {15528#true} is VALID [2020-07-10 19:04:42,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {15528#true} #valid := #valid[0 := 0]; {15528#true} is VALID [2020-07-10 19:04:42,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {15528#true} assume 0 < #StackHeapBarrier; {15528#true} is VALID [2020-07-10 19:04:42,030 INFO L280 TraceCheckUtils]: 3: Hoare triple {15528#true} assume true; {15528#true} is VALID [2020-07-10 19:04:42,030 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {15528#true} {15528#true} #414#return; {15528#true} is VALID [2020-07-10 19:04:42,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {15528#true} call ULTIMATE.init(); {15540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:42,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {15540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {15528#true} is VALID [2020-07-10 19:04:42,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {15528#true} #valid := #valid[0 := 0]; {15528#true} is VALID [2020-07-10 19:04:42,031 INFO L280 TraceCheckUtils]: 3: Hoare triple {15528#true} assume 0 < #StackHeapBarrier; {15528#true} is VALID [2020-07-10 19:04:42,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {15528#true} assume true; {15528#true} is VALID [2020-07-10 19:04:42,032 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {15528#true} {15528#true} #414#return; {15528#true} is VALID [2020-07-10 19:04:42,032 INFO L263 TraceCheckUtils]: 6: Hoare triple {15528#true} call #t~ret28 := main(); {15528#true} is VALID [2020-07-10 19:04:42,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {15528#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {15528#true} is VALID [2020-07-10 19:04:42,032 INFO L280 TraceCheckUtils]: 8: Hoare triple {15528#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {15528#true} is VALID [2020-07-10 19:04:42,032 INFO L280 TraceCheckUtils]: 9: Hoare triple {15528#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {15528#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {15528#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 12: Hoare triple {15528#true} goto; {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 13: Hoare triple {15528#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 14: Hoare triple {15528#true} assume 0 != #t~nondet1; {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 15: Hoare triple {15528#true} havoc #t~nondet1; {15528#true} is VALID [2020-07-10 19:04:42,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {15528#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {15528#true} is VALID [2020-07-10 19:04:42,034 INFO L280 TraceCheckUtils]: 17: Hoare triple {15528#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {15535#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:42,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {15535#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {15536#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-10 19:04:42,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {15536#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,037 INFO L280 TraceCheckUtils]: 20: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,037 INFO L280 TraceCheckUtils]: 21: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,038 INFO L280 TraceCheckUtils]: 22: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,039 INFO L280 TraceCheckUtils]: 23: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem6.base, #t~mem6.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,039 INFO L280 TraceCheckUtils]: 24: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem5.base, #t~mem5.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,040 INFO L280 TraceCheckUtils]: 25: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~short7; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,041 INFO L280 TraceCheckUtils]: 26: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,041 INFO L280 TraceCheckUtils]: 27: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,042 INFO L280 TraceCheckUtils]: 28: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,043 INFO L280 TraceCheckUtils]: 29: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,044 INFO L280 TraceCheckUtils]: 30: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~nondet8; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,044 INFO L280 TraceCheckUtils]: 31: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,045 INFO L280 TraceCheckUtils]: 32: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,046 INFO L280 TraceCheckUtils]: 33: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,047 INFO L280 TraceCheckUtils]: 34: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,048 INFO L280 TraceCheckUtils]: 35: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,049 INFO L280 TraceCheckUtils]: 36: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~len~0 := 0; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,050 INFO L280 TraceCheckUtils]: 37: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,050 INFO L280 TraceCheckUtils]: 38: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,051 INFO L280 TraceCheckUtils]: 39: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem19.base, #t~mem19.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,051 INFO L280 TraceCheckUtils]: 40: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,052 INFO L280 TraceCheckUtils]: 41: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(~len~0 <= 1); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,053 INFO L280 TraceCheckUtils]: 42: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,054 INFO L280 TraceCheckUtils]: 43: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1032-4 {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,055 INFO L280 TraceCheckUtils]: 44: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,056 INFO L280 TraceCheckUtils]: 45: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem23.base, #t~mem23.offset; {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,056 INFO L280 TraceCheckUtils]: 46: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,057 INFO L280 TraceCheckUtils]: 47: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 19:04:42,058 INFO L280 TraceCheckUtils]: 48: Hoare triple {15537#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L1040 {15538#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} is VALID [2020-07-10 19:04:42,059 INFO L280 TraceCheckUtils]: 49: Hoare triple {15538#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {15539#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:42,059 INFO L280 TraceCheckUtils]: 50: Hoare triple {15539#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem24.base, #t~mem24.offset; {15539#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:42,065 INFO L280 TraceCheckUtils]: 51: Hoare triple {15539#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {15529#false} is VALID [2020-07-10 19:04:42,065 INFO L280 TraceCheckUtils]: 52: Hoare triple {15529#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {15529#false} is VALID [2020-07-10 19:04:42,066 INFO L280 TraceCheckUtils]: 53: Hoare triple {15529#false} assume !false; {15529#false} is VALID [2020-07-10 19:04:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:42,073 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:42,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [401081819] [2020-07-10 19:04:42,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:42,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:04:42,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379795541] [2020-07-10 19:04:42,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-10 19:04:42,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:42,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:04:42,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:42,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:04:42,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:42,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:04:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:42,154 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 8 states. [2020-07-10 19:04:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:46,144 INFO L93 Difference]: Finished difference Result 297 states and 316 transitions. [2020-07-10 19:04:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:04:46,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-10 19:04:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2020-07-10 19:04:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2020-07-10 19:04:46,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 267 transitions. [2020-07-10 19:04:46,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:46,509 INFO L225 Difference]: With dead ends: 297 [2020-07-10 19:04:46,509 INFO L226 Difference]: Without dead ends: 267 [2020-07-10 19:04:46,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:04:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-07-10 19:04:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2020-07-10 19:04:48,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:48,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 248 states. [2020-07-10 19:04:48,616 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 248 states. [2020-07-10 19:04:48,616 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 248 states. [2020-07-10 19:04:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:48,624 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2020-07-10 19:04:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions. [2020-07-10 19:04:48,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:48,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:48,625 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 267 states. [2020-07-10 19:04:48,625 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 267 states. [2020-07-10 19:04:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:48,633 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2020-07-10 19:04:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions. [2020-07-10 19:04:48,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:48,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:48,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:48,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-10 19:04:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 268 transitions. [2020-07-10 19:04:48,641 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 268 transitions. Word has length 54 [2020-07-10 19:04:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:48,642 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 268 transitions. [2020-07-10 19:04:48,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:04:48,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 248 states and 268 transitions. [2020-07-10 19:04:49,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 268 transitions. [2020-07-10 19:04:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 19:04:49,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:49,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:49,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 19:04:49,672 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1270543956, now seen corresponding path program 1 times [2020-07-10 19:04:49,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:49,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278821958] [2020-07-10 19:04:49,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:49,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {17183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {17175#true} is VALID [2020-07-10 19:04:49,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {17175#true} #valid := #valid[0 := 0]; {17175#true} is VALID [2020-07-10 19:04:49,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {17175#true} assume 0 < #StackHeapBarrier; {17175#true} is VALID [2020-07-10 19:04:49,744 INFO L280 TraceCheckUtils]: 3: Hoare triple {17175#true} assume true; {17175#true} is VALID [2020-07-10 19:04:49,745 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {17175#true} {17175#true} #414#return; {17175#true} is VALID [2020-07-10 19:04:49,746 INFO L263 TraceCheckUtils]: 0: Hoare triple {17175#true} call ULTIMATE.init(); {17183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:49,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {17183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {17175#true} is VALID [2020-07-10 19:04:49,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {17175#true} #valid := #valid[0 := 0]; {17175#true} is VALID [2020-07-10 19:04:49,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {17175#true} assume 0 < #StackHeapBarrier; {17175#true} is VALID [2020-07-10 19:04:49,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {17175#true} assume true; {17175#true} is VALID [2020-07-10 19:04:49,747 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {17175#true} {17175#true} #414#return; {17175#true} is VALID [2020-07-10 19:04:49,747 INFO L263 TraceCheckUtils]: 6: Hoare triple {17175#true} call #t~ret28 := main(); {17175#true} is VALID [2020-07-10 19:04:49,747 INFO L280 TraceCheckUtils]: 7: Hoare triple {17175#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {17175#true} is VALID [2020-07-10 19:04:49,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {17175#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {17175#true} is VALID [2020-07-10 19:04:49,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {17175#true} is VALID [2020-07-10 19:04:49,748 INFO L280 TraceCheckUtils]: 10: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {17175#true} is VALID [2020-07-10 19:04:49,748 INFO L280 TraceCheckUtils]: 11: Hoare triple {17175#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {17175#true} is VALID [2020-07-10 19:04:49,749 INFO L280 TraceCheckUtils]: 12: Hoare triple {17175#true} goto; {17175#true} is VALID [2020-07-10 19:04:49,749 INFO L280 TraceCheckUtils]: 13: Hoare triple {17175#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17175#true} is VALID [2020-07-10 19:04:49,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {17175#true} assume 0 != #t~nondet1; {17175#true} is VALID [2020-07-10 19:04:49,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {17175#true} havoc #t~nondet1; {17175#true} is VALID [2020-07-10 19:04:49,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {17175#true} is VALID [2020-07-10 19:04:49,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {17175#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {17175#true} is VALID [2020-07-10 19:04:49,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {17175#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {17175#true} is VALID [2020-07-10 19:04:49,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {17175#true} assume !#t~short7; {17175#true} is VALID [2020-07-10 19:04:49,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {17175#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {17175#true} is VALID [2020-07-10 19:04:49,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {17175#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {17175#true} is VALID [2020-07-10 19:04:49,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {17175#true} assume !!#t~short7; {17175#true} is VALID [2020-07-10 19:04:49,751 INFO L280 TraceCheckUtils]: 23: Hoare triple {17175#true} havoc #t~mem6.base, #t~mem6.offset; {17175#true} is VALID [2020-07-10 19:04:49,751 INFO L280 TraceCheckUtils]: 24: Hoare triple {17175#true} havoc #t~mem5.base, #t~mem5.offset; {17175#true} is VALID [2020-07-10 19:04:49,752 INFO L280 TraceCheckUtils]: 25: Hoare triple {17175#true} havoc #t~short7; {17175#true} is VALID [2020-07-10 19:04:49,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {17175#true} goto; {17175#true} is VALID [2020-07-10 19:04:49,752 INFO L280 TraceCheckUtils]: 27: Hoare triple {17175#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {17175#true} is VALID [2020-07-10 19:04:49,752 INFO L280 TraceCheckUtils]: 28: Hoare triple {17175#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {17175#true} is VALID [2020-07-10 19:04:49,753 INFO L280 TraceCheckUtils]: 29: Hoare triple {17175#true} assume !!(0 != #t~nondet8); {17175#true} is VALID [2020-07-10 19:04:49,753 INFO L280 TraceCheckUtils]: 30: Hoare triple {17175#true} havoc #t~nondet8; {17175#true} is VALID [2020-07-10 19:04:49,753 INFO L280 TraceCheckUtils]: 31: Hoare triple {17175#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12); srcloc: L1003 {17175#true} is VALID [2020-07-10 19:04:49,753 INFO L280 TraceCheckUtils]: 32: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1003-1 {17175#true} is VALID [2020-07-10 19:04:49,754 INFO L280 TraceCheckUtils]: 33: Hoare triple {17175#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1003-2 {17175#true} is VALID [2020-07-10 19:04:49,754 INFO L280 TraceCheckUtils]: 34: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4); srcloc: L1004 {17175#true} is VALID [2020-07-10 19:04:49,754 INFO L280 TraceCheckUtils]: 35: Hoare triple {17175#true} havoc #t~mem10.base, #t~mem10.offset; {17175#true} is VALID [2020-07-10 19:04:49,754 INFO L280 TraceCheckUtils]: 36: Hoare triple {17175#true} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005 {17175#true} is VALID [2020-07-10 19:04:49,754 INFO L280 TraceCheckUtils]: 37: Hoare triple {17175#true} ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; {17175#true} is VALID [2020-07-10 19:04:49,755 INFO L280 TraceCheckUtils]: 38: Hoare triple {17175#true} havoc #t~mem11.base, #t~mem11.offset; {17175#true} is VALID [2020-07-10 19:04:49,755 INFO L280 TraceCheckUtils]: 39: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1006 {17175#true} is VALID [2020-07-10 19:04:49,755 INFO L280 TraceCheckUtils]: 40: Hoare triple {17175#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {17175#true} is VALID [2020-07-10 19:04:49,755 INFO L280 TraceCheckUtils]: 41: Hoare triple {17175#true} goto; {17175#true} is VALID [2020-07-10 19:04:49,756 INFO L280 TraceCheckUtils]: 42: Hoare triple {17175#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {17175#true} is VALID [2020-07-10 19:04:49,756 INFO L280 TraceCheckUtils]: 43: Hoare triple {17175#true} goto; {17175#true} is VALID [2020-07-10 19:04:49,756 INFO L280 TraceCheckUtils]: 44: Hoare triple {17175#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {17175#true} is VALID [2020-07-10 19:04:49,756 INFO L280 TraceCheckUtils]: 45: Hoare triple {17175#true} assume 0 != #t~nondet12; {17175#true} is VALID [2020-07-10 19:04:49,757 INFO L280 TraceCheckUtils]: 46: Hoare triple {17175#true} havoc #t~nondet12; {17175#true} is VALID [2020-07-10 19:04:49,757 INFO L280 TraceCheckUtils]: 47: Hoare triple {17175#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1008-7 {17175#true} is VALID [2020-07-10 19:04:49,757 INFO L280 TraceCheckUtils]: 48: Hoare triple {17175#true} SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1008-34 {17175#true} is VALID [2020-07-10 19:04:49,757 INFO L280 TraceCheckUtils]: 49: Hoare triple {17175#true} #t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {17175#true} is VALID [2020-07-10 19:04:49,758 INFO L280 TraceCheckUtils]: 50: Hoare triple {17175#true} assume #t~short18; {17182#|main_#t~short18|} is VALID [2020-07-10 19:04:49,759 INFO L280 TraceCheckUtils]: 51: Hoare triple {17182#|main_#t~short18|} assume !#t~short18; {17176#false} is VALID [2020-07-10 19:04:49,759 INFO L280 TraceCheckUtils]: 52: Hoare triple {17176#false} havoc #t~short18; {17176#false} is VALID [2020-07-10 19:04:49,759 INFO L280 TraceCheckUtils]: 53: Hoare triple {17176#false} havoc #t~mem16.base, #t~mem16.offset; {17176#false} is VALID [2020-07-10 19:04:49,759 INFO L280 TraceCheckUtils]: 54: Hoare triple {17176#false} havoc #t~mem17.base, #t~mem17.offset; {17176#false} is VALID [2020-07-10 19:04:49,760 INFO L280 TraceCheckUtils]: 55: Hoare triple {17176#false} assume !false; {17176#false} is VALID [2020-07-10 19:04:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:49,762 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:49,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278821958] [2020-07-10 19:04:49,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:49,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:49,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065577304] [2020-07-10 19:04:49,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-07-10 19:04:49,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:49,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:49,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:49,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:49,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:49,832 INFO L87 Difference]: Start difference. First operand 248 states and 268 transitions. Second operand 4 states. [2020-07-10 19:04:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:52,439 INFO L93 Difference]: Finished difference Result 254 states and 274 transitions. [2020-07-10 19:04:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:52,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-07-10 19:04:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-10 19:04:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-10 19:04:52,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 170 transitions. [2020-07-10 19:04:52,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:52,643 INFO L225 Difference]: With dead ends: 254 [2020-07-10 19:04:52,643 INFO L226 Difference]: Without dead ends: 249 [2020-07-10 19:04:52,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-10 19:04:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2020-07-10 19:04:54,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:54,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 249 states. [2020-07-10 19:04:54,750 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 249 states. [2020-07-10 19:04:54,751 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 249 states. [2020-07-10 19:04:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:54,756 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-07-10 19:04:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-10 19:04:54,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:54,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:54,757 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 249 states. [2020-07-10 19:04:54,757 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 249 states. [2020-07-10 19:04:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:54,762 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-07-10 19:04:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-10 19:04:54,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:54,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:54,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:54,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-07-10 19:04:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2020-07-10 19:04:54,769 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 56 [2020-07-10 19:04:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:54,769 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2020-07-10 19:04:54,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:54,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 249 states and 269 transitions. [2020-07-10 19:04:55,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-10 19:04:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 19:04:55,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:55,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:55,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 19:04:55,763 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2002844954, now seen corresponding path program 1 times [2020-07-10 19:04:55,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:55,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809970560] [2020-07-10 19:04:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:55,834 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:55,834 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 19:04:55,835 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 19:04:55,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 19:04:55,856 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 19:04:55,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:55,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:55,856 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 19:04:55,856 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: L993-1 has no Hoare annotation [2020-07-10 19:04:55,857 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-10 19:04:55,858 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-7 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-10 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-34 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-34 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-10 19:04:55,859 WARN L170 areAnnotationChecker]: L995-19 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-35 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-20 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-20 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L1008-35 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L1008-35 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-13 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-24 has no Hoare annotation [2020-07-10 19:04:55,860 WARN L170 areAnnotationChecker]: L995-24 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L995-22 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L1000-5 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L995-25 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L995-30 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L995-23 has no Hoare annotation [2020-07-10 19:04:55,861 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L1000-2 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L1000-4 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L995-26 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L995-31 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-10 19:04:55,862 WARN L170 areAnnotationChecker]: L995-16 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L995-27 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L995-32 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-10 19:04:55,863 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L995-17 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L995-28 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L995-28 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L995-33 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L995-33 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 19:04:55,864 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1003-2 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2020-07-10 19:04:55,865 WARN L170 areAnnotationChecker]: L1020-1 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1004-1 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1040-2 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1020-2 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 19:04:55,866 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1042-2 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-10 19:04:55,867 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1050 has no Hoare annotation [2020-07-10 19:04:55,868 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1046-6 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1046-6 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1050-1 has no Hoare annotation [2020-07-10 19:04:55,869 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1046-7 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-10 19:04:55,870 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-10 19:04:55,871 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1047 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-10 19:04:55,872 WARN L170 areAnnotationChecker]: L1029-6 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1029-6 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1046-2 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1046-2 has no Hoare annotation [2020-07-10 19:04:55,873 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1029-7 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-10 19:04:55,874 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1008-6 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1008-9 has no Hoare annotation [2020-07-10 19:04:55,875 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1008-7 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1008-34 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1008-34 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-10 19:04:55,876 WARN L170 areAnnotationChecker]: L1008-19 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-12 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-20 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-20 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-24 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-24 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-22 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-25 has no Hoare annotation [2020-07-10 19:04:55,877 WARN L170 areAnnotationChecker]: L1008-30 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-23 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-26 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-31 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-16 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-27 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-32 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-17 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-28 has no Hoare annotation [2020-07-10 19:04:55,878 WARN L170 areAnnotationChecker]: L1008-28 has no Hoare annotation [2020-07-10 19:04:55,879 WARN L170 areAnnotationChecker]: L1008-33 has no Hoare annotation [2020-07-10 19:04:55,879 WARN L170 areAnnotationChecker]: L1008-33 has no Hoare annotation [2020-07-10 19:04:55,879 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:04:55,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:04:55 BoogieIcfgContainer [2020-07-10 19:04:55,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:04:55,886 INFO L168 Benchmark]: Toolchain (without parser) took 66846.71 ms. Allocated memory was 136.8 MB in the beginning and 561.0 MB in the end (delta: 424.1 MB). Free memory was 100.3 MB in the beginning and 155.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 368.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,887 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.92 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 168.2 MB in the end (delta: -68.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,888 INFO L168 Benchmark]: Boogie Preprocessor took 114.06 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 163.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,889 INFO L168 Benchmark]: RCFGBuilder took 1188.85 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 163.9 MB in the beginning and 191.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,890 INFO L168 Benchmark]: TraceAbstraction took 64818.71 ms. Allocated memory was 231.7 MB in the beginning and 561.0 MB in the end (delta: 329.3 MB). Free memory was 191.8 MB in the beginning and 155.8 MB in the end (delta: 35.9 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:55,892 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 715.92 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 168.2 MB in the end (delta: -68.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.06 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 163.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1188.85 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 163.9 MB in the beginning and 191.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64818.71 ms. Allocated memory was 231.7 MB in the beginning and 561.0 MB in the end (delta: 329.3 MB). Free memory was 191.8 MB in the beginning and 155.8 MB in the end (delta: 35.9 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) [L995] COND FALSE !(!(list != ((void*)0))) [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list [L1015] COND FALSE !(!(((void*)0) != end)) [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner [L1023] COND TRUE len == 0 [L1024] len = 1 [L1027] COND FALSE !(!(((void*)0) != inner)) [L1028] EXPR inner->inner [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 64.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 43.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1954 SDtfs, 3772 SDslu, 5861 SDs, 0 SdLazy, 4150 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 928 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...