/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/sll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:04:12,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:04:12,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:04:12,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:04:12,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:04:12,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:04:12,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:04:12,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:04:12,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:04:12,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:04:12,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:04:12,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:04:12,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:04:12,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:04:12,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:04:12,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:04:12,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:04:12,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:04:12,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:04:12,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:04:12,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:04:12,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:04:12,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:04:12,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:04:12,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:04:12,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:04:12,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:04:12,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:04:12,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:04:12,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:04:12,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:04:12,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:04:12,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:04:12,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:04:12,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:04:12,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:04:12,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:04:12,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:04:12,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:04:12,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:04:12,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:04:12,778 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:04:12,787 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:04:12,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:04:12,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:04:12,788 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:04:12,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:04:12,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:04:12,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:04:12,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:04:12,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:04:12,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:04:12,790 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:04:12,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:04:12,790 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:04:12,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:04:12,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:04:12,791 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:04:12,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:04:12,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:04:12,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:12,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:04:12,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:04:12,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:04:12,792 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:04:13,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:04:13,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:04:13,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:04:13,141 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:04:13,142 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:04:13,143 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-2.i [2020-07-10 19:04:13,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b69359d6/6e0db2424fc042bc8178af6fc252ccc1/FLAG05eb1dc06 [2020-07-10 19:04:13,746 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:04:13,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-2.i [2020-07-10 19:04:13,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b69359d6/6e0db2424fc042bc8178af6fc252ccc1/FLAG05eb1dc06 [2020-07-10 19:04:14,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b69359d6/6e0db2424fc042bc8178af6fc252ccc1 [2020-07-10 19:04:14,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:04:14,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:04:14,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:14,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:04:14,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:04:14,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100253a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14, skipping insertion in model container [2020-07-10 19:04:14,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:04:14,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:04:14,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:14,610 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:04:14,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:14,711 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:04:14,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14 WrapperNode [2020-07-10 19:04:14,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:14,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:04:14,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:04:14,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:04:14,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (1/1) ... [2020-07-10 19:04:14,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:04:14,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:04:14,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:04:14,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:04:14,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (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:04:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:04:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:04:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:04:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:04:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:04:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:04:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:04:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:04:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:04:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:04:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:04:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:04:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:04:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:04:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:04:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:04:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:04:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:04:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:04:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:04:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:04:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:04:14,870 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:04:14,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:04:14,871 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:04:14,871 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:04:14,871 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:04:14,871 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:04:14,871 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:04:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:04:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:04:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:04:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:04:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:04:14,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:04:14,873 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:04:14,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:04:14,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:04:14,873 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:04:14,873 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:04:14,873 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:04:14,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:04:14,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:04:14,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:04:14,874 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:04:14,874 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:04:14,875 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:04:14,875 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:04:14,875 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:04:14,875 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:04:14,875 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:04:14,875 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:04:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:04:14,877 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:04:14,877 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:04:14,877 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:04:14,878 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:04:14,878 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:04:14,878 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:04:14,879 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:04:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:04:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:04:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:04:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:04:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:04:14,880 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:04:14,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:04:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:04:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:04:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:04:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:04:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:04:14,882 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:04:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:04:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:04:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:04:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:04:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:04:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:04:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:04:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:04:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:04:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:04:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:04:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:04:15,592 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:04:15,593 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-10 19:04:15,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:15 BoogieIcfgContainer [2020-07-10 19:04:15,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:04:15,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:04:15,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:04:15,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:04:15,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:04:14" (1/3) ... [2020-07-10 19:04:15,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e65a9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:15, skipping insertion in model container [2020-07-10 19:04:15,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:14" (2/3) ... [2020-07-10 19:04:15,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e65a9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:15, skipping insertion in model container [2020-07-10 19:04:15,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:15" (3/3) ... [2020-07-10 19:04:15,606 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2020-07-10 19:04:15,615 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:04:15,623 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-10 19:04:15,638 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-10 19:04:15,661 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:04:15,661 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:04:15,661 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:04:15,661 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:04:15,662 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:04:15,662 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:04:15,662 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:04:15,662 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:04:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2020-07-10 19:04:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 19:04:15,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:15,689 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] [2020-07-10 19:04:15,690 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash -976698803, now seen corresponding path program 1 times [2020-07-10 19:04:15,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:15,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807646654] [2020-07-10 19:04:15,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:15,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {96#true} is VALID [2020-07-10 19:04:15,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#true} #valid := #valid[0 := 0]; {96#true} is VALID [2020-07-10 19:04:15,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {96#true} assume 0 < #StackHeapBarrier; {96#true} is VALID [2020-07-10 19:04:15,975 INFO L280 TraceCheckUtils]: 3: Hoare triple {96#true} assume true; {96#true} is VALID [2020-07-10 19:04:15,975 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {96#true} {96#true} #184#return; {96#true} is VALID [2020-07-10 19:04:15,980 INFO L263 TraceCheckUtils]: 0: Hoare triple {96#true} call ULTIMATE.init(); {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:15,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {96#true} is VALID [2020-07-10 19:04:15,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {96#true} #valid := #valid[0 := 0]; {96#true} is VALID [2020-07-10 19:04:15,981 INFO L280 TraceCheckUtils]: 3: Hoare triple {96#true} assume 0 < #StackHeapBarrier; {96#true} is VALID [2020-07-10 19:04:15,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {96#true} assume true; {96#true} is VALID [2020-07-10 19:04:15,982 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {96#true} {96#true} #184#return; {96#true} is VALID [2020-07-10 19:04:15,982 INFO L263 TraceCheckUtils]: 6: Hoare triple {96#true} call #t~ret17 := main(); {96#true} is VALID [2020-07-10 19:04:15,983 INFO L280 TraceCheckUtils]: 7: Hoare triple {96#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {96#true} is VALID [2020-07-10 19:04:15,984 INFO L280 TraceCheckUtils]: 8: Hoare triple {96#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {96#true} is VALID [2020-07-10 19:04:15,984 INFO L280 TraceCheckUtils]: 9: Hoare triple {96#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {96#true} is VALID [2020-07-10 19:04:15,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {96#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L986-1 {96#true} is VALID [2020-07-10 19:04:15,985 INFO L280 TraceCheckUtils]: 11: Hoare triple {96#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {96#true} is VALID [2020-07-10 19:04:15,985 INFO L280 TraceCheckUtils]: 12: Hoare triple {96#true} ~state~0 := 1; {96#true} is VALID [2020-07-10 19:04:15,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {96#true} assume !true; {97#false} is VALID [2020-07-10 19:04:15,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {97#false} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L993-5 {97#false} is VALID [2020-07-10 19:04:15,988 INFO L280 TraceCheckUtils]: 15: Hoare triple {97#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1014 {97#false} is VALID [2020-07-10 19:04:15,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {97#false} ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; {97#false} is VALID [2020-07-10 19:04:15,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {97#false} havoc #t~mem5.base, #t~mem5.offset; {97#false} is VALID [2020-07-10 19:04:15,992 INFO L280 TraceCheckUtils]: 18: Hoare triple {97#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {97#false} is VALID [2020-07-10 19:04:15,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {97#false} assume !false; {97#false} is VALID [2020-07-10 19:04:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:15,996 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:15,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807646654] [2020-07-10 19:04:16,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:16,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 19:04:16,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194769625] [2020-07-10 19:04:16,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 19:04:16,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:16,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 19:04:16,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:16,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 19:04:16,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 19:04:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:04:16,075 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 3 states. [2020-07-10 19:04:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:16,648 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2020-07-10 19:04:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 19:04:16,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 19:04:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:04:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-10 19:04:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:04:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-10 19:04:16,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2020-07-10 19:04:16,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:16,961 INFO L225 Difference]: With dead ends: 173 [2020-07-10 19:04:16,961 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 19:04:16,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:04:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 19:04:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-10 19:04:17,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:17,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:17,050 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:17,050 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:17,057 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-10 19:04:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-10 19:04:17,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:17,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:17,059 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:17,060 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 19:04:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:17,067 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-10 19:04:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-10 19:04:17,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:17,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:17,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:17,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 19:04:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-07-10 19:04:17,076 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 20 [2020-07-10 19:04:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:17,076 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-07-10 19:04:17,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 19:04:17,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 79 transitions. [2020-07-10 19:04:17,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-10 19:04:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 19:04:17,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:17,187 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] [2020-07-10 19:04:17,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:04:17,188 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1430822134, now seen corresponding path program 1 times [2020-07-10 19:04:17,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:17,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1582033914] [2020-07-10 19:04:17,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:17,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {748#true} is VALID [2020-07-10 19:04:17,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {748#true} #valid := #valid[0 := 0]; {748#true} is VALID [2020-07-10 19:04:17,528 INFO L280 TraceCheckUtils]: 2: Hoare triple {748#true} assume 0 < #StackHeapBarrier; {748#true} is VALID [2020-07-10 19:04:17,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {748#true} assume true; {748#true} is VALID [2020-07-10 19:04:17,529 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {748#true} {748#true} #184#return; {748#true} is VALID [2020-07-10 19:04:17,534 INFO L263 TraceCheckUtils]: 0: Hoare triple {748#true} call ULTIMATE.init(); {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:17,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {762#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {748#true} is VALID [2020-07-10 19:04:17,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {748#true} #valid := #valid[0 := 0]; {748#true} is VALID [2020-07-10 19:04:17,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {748#true} assume 0 < #StackHeapBarrier; {748#true} is VALID [2020-07-10 19:04:17,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {748#true} assume true; {748#true} is VALID [2020-07-10 19:04:17,536 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {748#true} {748#true} #184#return; {748#true} is VALID [2020-07-10 19:04:17,536 INFO L263 TraceCheckUtils]: 6: Hoare triple {748#true} call #t~ret17 := main(); {748#true} is VALID [2020-07-10 19:04:17,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {748#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {755#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-10 19:04:17,538 INFO L280 TraceCheckUtils]: 8: Hoare triple {755#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {756#(and (not (= 0 main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:17,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {756#(and (not (= 0 main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {757#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:17,542 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L986-1 {757#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:17,543 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-10 19:04:17,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} ~state~0 := 1; {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-10 19:04:17,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-10 19:04:17,547 INFO L280 TraceCheckUtils]: 14: Hoare triple {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} assume !(0 != #t~nondet1); {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-10 19:04:17,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} havoc #t~nondet1; {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} is VALID [2020-07-10 19:04:17,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))))} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L993-5 {759#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-10 19:04:17,552 INFO L280 TraceCheckUtils]: 17: Hoare triple {759#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1014 {760#(not (= 0 |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:17,553 INFO L280 TraceCheckUtils]: 18: Hoare triple {760#(not (= 0 |main_#t~mem5.base|))} ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; {761#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:17,554 INFO L280 TraceCheckUtils]: 19: Hoare triple {761#(not (= 0 main_~x~0.base))} havoc #t~mem5.base, #t~mem5.offset; {761#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:17,555 INFO L280 TraceCheckUtils]: 20: Hoare triple {761#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {749#false} is VALID [2020-07-10 19:04:17,556 INFO L280 TraceCheckUtils]: 21: Hoare triple {749#false} assume !false; {749#false} is VALID [2020-07-10 19:04:17,558 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:17,559 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:17,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1582033914] [2020-07-10 19:04:17,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:17,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 19:04:17,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84179206] [2020-07-10 19:04:17,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-10 19:04:17,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:17,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 19:04:17,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:17,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 19:04:17,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 19:04:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 19:04:17,595 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 10 states. [2020-07-10 19:04:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:19,469 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2020-07-10 19:04:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:04:19,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-10 19:04:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 19:04:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2020-07-10 19:04:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 19:04:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2020-07-10 19:04:19,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 157 transitions. [2020-07-10 19:04:19,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:19,713 INFO L225 Difference]: With dead ends: 149 [2020-07-10 19:04:19,714 INFO L226 Difference]: Without dead ends: 147 [2020-07-10 19:04:19,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-07-10 19:04:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-07-10 19:04:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 82. [2020-07-10 19:04:19,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:19,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 82 states. [2020-07-10 19:04:19,976 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 82 states. [2020-07-10 19:04:19,976 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 82 states. [2020-07-10 19:04:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:19,984 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-07-10 19:04:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2020-07-10 19:04:19,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:19,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:19,991 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 147 states. [2020-07-10 19:04:19,991 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 147 states. [2020-07-10 19:04:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:20,003 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-07-10 19:04:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2020-07-10 19:04:20,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:20,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:20,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:20,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-10 19:04:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-07-10 19:04:20,014 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 22 [2020-07-10 19:04:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:20,015 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-07-10 19:04:20,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 19:04:20,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 88 transitions. [2020-07-10 19:04:20,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-07-10 19:04:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 19:04:20,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:20,146 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] [2020-07-10 19:04:20,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:04:20,147 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash 340604940, now seen corresponding path program 1 times [2020-07-10 19:04:20,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:20,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068533931] [2020-07-10 19:04:20,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:20,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {1546#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1535#true} is VALID [2020-07-10 19:04:20,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {1535#true} #valid := #valid[0 := 0]; {1535#true} is VALID [2020-07-10 19:04:20,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {1535#true} assume 0 < #StackHeapBarrier; {1535#true} is VALID [2020-07-10 19:04:20,291 INFO L280 TraceCheckUtils]: 3: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-10 19:04:20,291 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1535#true} {1535#true} #184#return; {1535#true} is VALID [2020-07-10 19:04:20,293 INFO L263 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1546#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:20,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {1546#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1535#true} is VALID [2020-07-10 19:04:20,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {1535#true} #valid := #valid[0 := 0]; {1535#true} is VALID [2020-07-10 19:04:20,294 INFO L280 TraceCheckUtils]: 3: Hoare triple {1535#true} assume 0 < #StackHeapBarrier; {1535#true} is VALID [2020-07-10 19:04:20,294 INFO L280 TraceCheckUtils]: 4: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-10 19:04:20,294 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1535#true} {1535#true} #184#return; {1535#true} is VALID [2020-07-10 19:04:20,295 INFO L263 TraceCheckUtils]: 6: Hoare triple {1535#true} call #t~ret17 := main(); {1535#true} is VALID [2020-07-10 19:04:20,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {1535#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1535#true} is VALID [2020-07-10 19:04:20,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {1535#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1535#true} is VALID [2020-07-10 19:04:20,295 INFO L280 TraceCheckUtils]: 9: Hoare triple {1535#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {1535#true} is VALID [2020-07-10 19:04:20,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {1535#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L986-1 {1535#true} is VALID [2020-07-10 19:04:20,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {1535#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1535#true} is VALID [2020-07-10 19:04:20,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {1535#true} ~state~0 := 1; {1535#true} is VALID [2020-07-10 19:04:20,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {1535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1535#true} is VALID [2020-07-10 19:04:20,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {1535#true} assume !!(0 != #t~nondet1); {1535#true} is VALID [2020-07-10 19:04:20,297 INFO L280 TraceCheckUtils]: 15: Hoare triple {1535#true} havoc #t~nondet1; {1535#true} is VALID [2020-07-10 19:04:20,298 INFO L280 TraceCheckUtils]: 16: Hoare triple {1535#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {1542#(not (= 0 |main_#t~malloc2.base|))} is VALID [2020-07-10 19:04:20,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {1542#(not (= 0 |main_#t~malloc2.base|))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L996-1 {1543#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:20,300 INFO L280 TraceCheckUtils]: 18: Hoare triple {1543#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L996-2 {1544#(not (= 0 |main_#t~mem3.base|))} is VALID [2020-07-10 19:04:20,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {1544#(not (= 0 |main_#t~mem3.base|))} ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,302 INFO L280 TraceCheckUtils]: 20: Hoare triple {1545#(not (= 0 main_~x~0.base))} havoc #t~mem3.base, #t~mem3.offset; {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,302 INFO L280 TraceCheckUtils]: 21: Hoare triple {1545#(not (= 0 main_~x~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L998 {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,303 INFO L280 TraceCheckUtils]: 22: Hoare triple {1545#(not (= 0 main_~x~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,304 INFO L280 TraceCheckUtils]: 23: Hoare triple {1545#(not (= 0 main_~x~0.base))} assume !(0 != #t~nondet4); {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,304 INFO L280 TraceCheckUtils]: 24: Hoare triple {1545#(not (= 0 main_~x~0.base))} havoc #t~nondet4; {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,305 INFO L280 TraceCheckUtils]: 25: Hoare triple {1545#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L1000-3 {1545#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:20,305 INFO L280 TraceCheckUtils]: 26: Hoare triple {1545#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {1536#false} is VALID [2020-07-10 19:04:20,306 INFO L280 TraceCheckUtils]: 27: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2020-07-10 19:04:20,307 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:20,307 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:20,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068533931] [2020-07-10 19:04:20,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:20,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:04:20,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128329532] [2020-07-10 19:04:20,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 19:04:20,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:20,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:04:20,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:20,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:04:20,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:04:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:04:20,342 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 7 states. [2020-07-10 19:04:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,554 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2020-07-10 19:04:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:04:21,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 19:04:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:04:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2020-07-10 19:04:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:04:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2020-07-10 19:04:21,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2020-07-10 19:04:21,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:21,690 INFO L225 Difference]: With dead ends: 118 [2020-07-10 19:04:21,691 INFO L226 Difference]: Without dead ends: 116 [2020-07-10 19:04:21,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-07-10 19:04:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-10 19:04:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2020-07-10 19:04:21,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:21,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 80 states. [2020-07-10 19:04:21,948 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 80 states. [2020-07-10 19:04:21,948 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 80 states. [2020-07-10 19:04:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,953 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2020-07-10 19:04:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2020-07-10 19:04:21,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:21,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:21,954 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 116 states. [2020-07-10 19:04:21,954 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 116 states. [2020-07-10 19:04:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,959 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2020-07-10 19:04:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2020-07-10 19:04:21,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:21,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:21,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:21,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 19:04:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2020-07-10 19:04:21,964 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 28 [2020-07-10 19:04:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:21,964 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2020-07-10 19:04:21,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:04:21,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 86 transitions. [2020-07-10 19:04:22,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2020-07-10 19:04:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 19:04:22,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:22,109 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:04:22,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:04:22,110 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:22,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1933129776, now seen corresponding path program 1 times [2020-07-10 19:04:22,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:22,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855788343] [2020-07-10 19:04:22,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:22,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {2198#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2190#true} is VALID [2020-07-10 19:04:22,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {2190#true} #valid := #valid[0 := 0]; {2190#true} is VALID [2020-07-10 19:04:22,173 INFO L280 TraceCheckUtils]: 2: Hoare triple {2190#true} assume 0 < #StackHeapBarrier; {2190#true} is VALID [2020-07-10 19:04:22,173 INFO L280 TraceCheckUtils]: 3: Hoare triple {2190#true} assume true; {2190#true} is VALID [2020-07-10 19:04:22,174 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2190#true} {2190#true} #184#return; {2190#true} is VALID [2020-07-10 19:04:22,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {2190#true} call ULTIMATE.init(); {2198#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:22,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {2198#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2190#true} is VALID [2020-07-10 19:04:22,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {2190#true} #valid := #valid[0 := 0]; {2190#true} is VALID [2020-07-10 19:04:22,176 INFO L280 TraceCheckUtils]: 3: Hoare triple {2190#true} assume 0 < #StackHeapBarrier; {2190#true} is VALID [2020-07-10 19:04:22,176 INFO L280 TraceCheckUtils]: 4: Hoare triple {2190#true} assume true; {2190#true} is VALID [2020-07-10 19:04:22,176 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2190#true} {2190#true} #184#return; {2190#true} is VALID [2020-07-10 19:04:22,177 INFO L263 TraceCheckUtils]: 6: Hoare triple {2190#true} call #t~ret17 := main(); {2190#true} is VALID [2020-07-10 19:04:22,177 INFO L280 TraceCheckUtils]: 7: Hoare triple {2190#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2190#true} is VALID [2020-07-10 19:04:22,177 INFO L280 TraceCheckUtils]: 8: Hoare triple {2190#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2190#true} is VALID [2020-07-10 19:04:22,177 INFO L280 TraceCheckUtils]: 9: Hoare triple {2190#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {2190#true} is VALID [2020-07-10 19:04:22,178 INFO L280 TraceCheckUtils]: 10: Hoare triple {2190#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L986-1 {2190#true} is VALID [2020-07-10 19:04:22,178 INFO L280 TraceCheckUtils]: 11: Hoare triple {2190#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2190#true} is VALID [2020-07-10 19:04:22,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {2190#true} ~state~0 := 1; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,179 INFO L280 TraceCheckUtils]: 13: Hoare triple {2197#(= 1 main_~state~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {2197#(= 1 main_~state~0)} assume !!(0 != #t~nondet1); {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {2197#(= 1 main_~state~0)} havoc #t~nondet1; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {2197#(= 1 main_~state~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,182 INFO L280 TraceCheckUtils]: 17: Hoare triple {2197#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L996-1 {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,182 INFO L280 TraceCheckUtils]: 18: Hoare triple {2197#(= 1 main_~state~0)} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L996-2 {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,183 INFO L280 TraceCheckUtils]: 19: Hoare triple {2197#(= 1 main_~state~0)} ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,183 INFO L280 TraceCheckUtils]: 20: Hoare triple {2197#(= 1 main_~state~0)} havoc #t~mem3.base, #t~mem3.offset; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,184 INFO L280 TraceCheckUtils]: 21: Hoare triple {2197#(= 1 main_~state~0)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L998 {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,185 INFO L280 TraceCheckUtils]: 22: Hoare triple {2197#(= 1 main_~state~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,185 INFO L280 TraceCheckUtils]: 23: Hoare triple {2197#(= 1 main_~state~0)} assume 0 != #t~nondet4; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,186 INFO L280 TraceCheckUtils]: 24: Hoare triple {2197#(= 1 main_~state~0)} havoc #t~nondet4; {2197#(= 1 main_~state~0)} is VALID [2020-07-10 19:04:22,186 INFO L280 TraceCheckUtils]: 25: Hoare triple {2197#(= 1 main_~state~0)} assume !(1 == ~state~0); {2191#false} is VALID [2020-07-10 19:04:22,187 INFO L280 TraceCheckUtils]: 26: Hoare triple {2191#false} assume !(2 == ~state~0); {2191#false} is VALID [2020-07-10 19:04:22,187 INFO L280 TraceCheckUtils]: 27: Hoare triple {2191#false} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L993-5 {2191#false} is VALID [2020-07-10 19:04:22,187 INFO L280 TraceCheckUtils]: 28: Hoare triple {2191#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1014 {2191#false} is VALID [2020-07-10 19:04:22,188 INFO L280 TraceCheckUtils]: 29: Hoare triple {2191#false} ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; {2191#false} is VALID [2020-07-10 19:04:22,188 INFO L280 TraceCheckUtils]: 30: Hoare triple {2191#false} havoc #t~mem5.base, #t~mem5.offset; {2191#false} is VALID [2020-07-10 19:04:22,188 INFO L280 TraceCheckUtils]: 31: Hoare triple {2191#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {2191#false} is VALID [2020-07-10 19:04:22,188 INFO L280 TraceCheckUtils]: 32: Hoare triple {2191#false} assume !false; {2191#false} is VALID [2020-07-10 19:04:22,190 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:22,190 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:22,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855788343] [2020-07-10 19:04:22,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:22,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:22,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334200505] [2020-07-10 19:04:22,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-10 19:04:22,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:22,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:22,225 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:22,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:22,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:22,226 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 4 states. [2020-07-10 19:04:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:23,037 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2020-07-10 19:04:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:23,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-10 19:04:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2020-07-10 19:04:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2020-07-10 19:04:23,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2020-07-10 19:04:23,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:23,260 INFO L225 Difference]: With dead ends: 195 [2020-07-10 19:04:23,260 INFO L226 Difference]: Without dead ends: 136 [2020-07-10 19:04:23,261 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:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-10 19:04:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2020-07-10 19:04:23,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:23,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 97 states. [2020-07-10 19:04:23,628 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 97 states. [2020-07-10 19:04:23,628 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 97 states. [2020-07-10 19:04:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:23,633 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2020-07-10 19:04:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2020-07-10 19:04:23,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:23,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:23,634 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 136 states. [2020-07-10 19:04:23,634 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 136 states. [2020-07-10 19:04:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:23,639 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2020-07-10 19:04:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2020-07-10 19:04:23,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:23,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:23,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:23,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 19:04:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2020-07-10 19:04:23,644 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 33 [2020-07-10 19:04:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:23,644 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2020-07-10 19:04:23,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:23,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 105 transitions. [2020-07-10 19:04:23,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2020-07-10 19:04:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 19:04:23,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:23,846 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] [2020-07-10 19:04:23,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:04:23,847 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1127481847, now seen corresponding path program 1 times [2020-07-10 19:04:23,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:23,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1885714035] [2020-07-10 19:04:23,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:24,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {3075#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3057#true} is VALID [2020-07-10 19:04:24,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {3057#true} #valid := #valid[0 := 0]; {3057#true} is VALID [2020-07-10 19:04:24,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {3057#true} assume 0 < #StackHeapBarrier; {3057#true} is VALID [2020-07-10 19:04:24,371 INFO L280 TraceCheckUtils]: 3: Hoare triple {3057#true} assume true; {3057#true} is VALID [2020-07-10 19:04:24,372 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3057#true} {3057#true} #184#return; {3057#true} is VALID [2020-07-10 19:04:24,388 INFO L263 TraceCheckUtils]: 0: Hoare triple {3057#true} call ULTIMATE.init(); {3075#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:24,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {3075#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3057#true} is VALID [2020-07-10 19:04:24,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {3057#true} #valid := #valid[0 := 0]; {3057#true} is VALID [2020-07-10 19:04:24,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {3057#true} assume 0 < #StackHeapBarrier; {3057#true} is VALID [2020-07-10 19:04:24,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {3057#true} assume true; {3057#true} is VALID [2020-07-10 19:04:24,389 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3057#true} {3057#true} #184#return; {3057#true} is VALID [2020-07-10 19:04:24,389 INFO L263 TraceCheckUtils]: 6: Hoare triple {3057#true} call #t~ret17 := main(); {3057#true} is VALID [2020-07-10 19:04:24,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {3057#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {3064#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:24,397 INFO L280 TraceCheckUtils]: 8: Hoare triple {3064#(= 0 |main_#t~malloc0.offset|)} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3065#(= 0 main_~head~0.offset)} is VALID [2020-07-10 19:04:24,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {3065#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {3066#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-10 19:04:24,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {3066#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L986-1 {3066#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-10 19:04:24,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {3066#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:24,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} ~state~0 := 1; {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:24,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:24,407 INFO L280 TraceCheckUtils]: 14: Hoare triple {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1); {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:24,408 INFO L280 TraceCheckUtils]: 15: Hoare triple {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} havoc #t~nondet1; {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-10 19:04:24,410 INFO L280 TraceCheckUtils]: 16: Hoare triple {3067#(and (not (= main_~head~0.offset (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L993-5 {3066#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2020-07-10 19:04:24,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {3066#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1014 {3068#(and (= 0 |main_#t~mem5.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem5.base|) |main_#t~mem5.offset|)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) |main_#t~mem5.offset|)))} is VALID [2020-07-10 19:04:24,414 INFO L280 TraceCheckUtils]: 18: Hoare triple {3068#(and (= 0 |main_#t~mem5.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem5.base|) |main_#t~mem5.offset|)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| |main_#t~mem5.base|) |main_#t~mem5.offset|)))} ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem5.base, #t~mem5.offset; {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,417 INFO L280 TraceCheckUtils]: 20: Hoare triple {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,418 INFO L280 TraceCheckUtils]: 21: Hoare triple {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} goto; {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,419 INFO L280 TraceCheckUtils]: 22: Hoare triple {3069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); srcloc: L1019-4 {3070#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) |main_#t~mem6|) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,420 INFO L280 TraceCheckUtils]: 23: Hoare triple {3070#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) |main_#t~mem6|) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != #t~mem6); {3071#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,420 INFO L280 TraceCheckUtils]: 24: Hoare triple {3071#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem6; {3071#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-10 19:04:24,421 INFO L280 TraceCheckUtils]: 25: Hoare triple {3071#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base) (= main_~x~0.offset 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1021-25 {3072#(not (= 0 (select (select |#memory_int| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4))))} is VALID [2020-07-10 19:04:24,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {3072#(not (= 0 (select (select |#memory_int| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4))))} SUMMARY for call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); srcloc: L1021-1 {3073#(not (= 0 |main_#t~mem8|))} is VALID [2020-07-10 19:04:24,422 INFO L280 TraceCheckUtils]: 27: Hoare triple {3073#(not (= 0 |main_#t~mem8|))} #t~short12 := 0 != #t~mem8; {3074#|main_#t~short12|} is VALID [2020-07-10 19:04:24,423 INFO L280 TraceCheckUtils]: 28: Hoare triple {3074#|main_#t~short12|} assume !#t~short12; {3058#false} is VALID [2020-07-10 19:04:24,423 INFO L280 TraceCheckUtils]: 29: Hoare triple {3058#false} assume !#t~short12; {3058#false} is VALID [2020-07-10 19:04:24,423 INFO L280 TraceCheckUtils]: 30: Hoare triple {3058#false} havoc #t~mem10; {3058#false} is VALID [2020-07-10 19:04:24,423 INFO L280 TraceCheckUtils]: 31: Hoare triple {3058#false} havoc #t~mem9.base, #t~mem9.offset; {3058#false} is VALID [2020-07-10 19:04:24,423 INFO L280 TraceCheckUtils]: 32: Hoare triple {3058#false} havoc #t~mem7.base, #t~mem7.offset; {3058#false} is VALID [2020-07-10 19:04:24,424 INFO L280 TraceCheckUtils]: 33: Hoare triple {3058#false} havoc #t~mem8; {3058#false} is VALID [2020-07-10 19:04:24,424 INFO L280 TraceCheckUtils]: 34: Hoare triple {3058#false} havoc #t~short12; {3058#false} is VALID [2020-07-10 19:04:24,424 INFO L280 TraceCheckUtils]: 35: Hoare triple {3058#false} havoc #t~mem11; {3058#false} is VALID [2020-07-10 19:04:24,424 INFO L280 TraceCheckUtils]: 36: Hoare triple {3058#false} assume !false; {3058#false} is VALID [2020-07-10 19:04:24,430 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:24,431 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:24,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1885714035] [2020-07-10 19:04:24,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:24,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:04:24,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957915459] [2020-07-10 19:04:24,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-10 19:04:24,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:24,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:04:24,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:24,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:04:24,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:04:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:04:24,473 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 14 states. [2020-07-10 19:04:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:27,298 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2020-07-10 19:04:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 19:04:27,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-10 19:04:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 182 transitions. [2020-07-10 19:04:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 182 transitions. [2020-07-10 19:04:27,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 182 transitions. [2020-07-10 19:04:27,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:27,545 INFO L225 Difference]: With dead ends: 190 [2020-07-10 19:04:27,545 INFO L226 Difference]: Without dead ends: 160 [2020-07-10 19:04:27,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2020-07-10 19:04:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-10 19:04:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2020-07-10 19:04:28,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:28,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 105 states. [2020-07-10 19:04:28,011 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 105 states. [2020-07-10 19:04:28,011 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 105 states. [2020-07-10 19:04:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:28,018 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2020-07-10 19:04:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2020-07-10 19:04:28,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:28,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:28,019 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 160 states. [2020-07-10 19:04:28,019 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 160 states. [2020-07-10 19:04:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:28,035 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2020-07-10 19:04:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2020-07-10 19:04:28,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:28,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:28,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:28,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-10 19:04:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2020-07-10 19:04:28,041 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 37 [2020-07-10 19:04:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:28,042 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2020-07-10 19:04:28,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:04:28,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 113 transitions. [2020-07-10 19:04:28,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2020-07-10 19:04:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 19:04:28,274 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:28,274 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:28,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:04:28,274 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 821991267, now seen corresponding path program 1 times [2020-07-10 19:04:28,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:28,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553536575] [2020-07-10 19:04:28,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:28,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {4040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4022#true} is VALID [2020-07-10 19:04:28,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {4022#true} #valid := #valid[0 := 0]; {4022#true} is VALID [2020-07-10 19:04:28,654 INFO L280 TraceCheckUtils]: 2: Hoare triple {4022#true} assume 0 < #StackHeapBarrier; {4022#true} is VALID [2020-07-10 19:04:28,655 INFO L280 TraceCheckUtils]: 3: Hoare triple {4022#true} assume true; {4022#true} is VALID [2020-07-10 19:04:28,655 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4022#true} {4022#true} #184#return; {4022#true} is VALID [2020-07-10 19:04:28,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {4022#true} call ULTIMATE.init(); {4040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:28,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {4040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4022#true} is VALID [2020-07-10 19:04:28,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {4022#true} #valid := #valid[0 := 0]; {4022#true} is VALID [2020-07-10 19:04:28,657 INFO L280 TraceCheckUtils]: 3: Hoare triple {4022#true} assume 0 < #StackHeapBarrier; {4022#true} is VALID [2020-07-10 19:04:28,657 INFO L280 TraceCheckUtils]: 4: Hoare triple {4022#true} assume true; {4022#true} is VALID [2020-07-10 19:04:28,658 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4022#true} {4022#true} #184#return; {4022#true} is VALID [2020-07-10 19:04:28,658 INFO L263 TraceCheckUtils]: 6: Hoare triple {4022#true} call #t~ret17 := main(); {4022#true} is VALID [2020-07-10 19:04:28,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {4022#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4029#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:28,661 INFO L280 TraceCheckUtils]: 8: Hoare triple {4029#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4030#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:28,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {4030#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {4030#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:28,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {4030#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L986-1 {4030#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-10 19:04:28,663 INFO L280 TraceCheckUtils]: 11: Hoare triple {4030#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-10 19:04:28,664 INFO L280 TraceCheckUtils]: 12: Hoare triple {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} ~state~0 := 1; {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-10 19:04:28,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-10 19:04:28,666 INFO L280 TraceCheckUtils]: 14: Hoare triple {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} assume !!(0 != #t~nondet1); {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-10 19:04:28,667 INFO L280 TraceCheckUtils]: 15: Hoare triple {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} havoc #t~nondet1; {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} is VALID [2020-07-10 19:04:28,668 INFO L280 TraceCheckUtils]: 16: Hoare triple {4031#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L996 {4032#(and (= 0 |main_#t~malloc2.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-10 19:04:28,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {4032#(and (= 0 |main_#t~malloc2.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L996-1 {4033#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-10 19:04:28,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {4033#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L996-2 {4034#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~head~0.base)) (= 0 |main_#t~mem3.offset|))} is VALID [2020-07-10 19:04:28,681 INFO L280 TraceCheckUtils]: 19: Hoare triple {4034#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~head~0.base)) (= 0 |main_#t~mem3.offset|))} ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,682 INFO L280 TraceCheckUtils]: 20: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} havoc #t~mem3.base, #t~mem3.offset; {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,684 INFO L280 TraceCheckUtils]: 21: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L998 {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,691 INFO L280 TraceCheckUtils]: 23: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} assume !(0 != #t~nondet4); {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,692 INFO L280 TraceCheckUtils]: 24: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} havoc #t~nondet4; {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,694 INFO L280 TraceCheckUtils]: 25: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L1000-3 {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} is VALID [2020-07-10 19:04:28,696 INFO L280 TraceCheckUtils]: 26: Hoare triple {4035#(and (not (= main_~head~0.base main_~x~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base) (= main_~x~0.offset 0))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-10 19:04:28,697 INFO L280 TraceCheckUtils]: 27: Hoare triple {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} goto; {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-10 19:04:28,698 INFO L280 TraceCheckUtils]: 28: Hoare triple {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-10 19:04:28,699 INFO L280 TraceCheckUtils]: 29: Hoare triple {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} assume !(0 != #t~nondet1); {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-10 19:04:28,700 INFO L280 TraceCheckUtils]: 30: Hoare triple {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} havoc #t~nondet1; {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} is VALID [2020-07-10 19:04:28,701 INFO L280 TraceCheckUtils]: 31: Hoare triple {4036#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base main_~x~0.base)))} SUMMARY for call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L993-5 {4037#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-10 19:04:28,702 INFO L280 TraceCheckUtils]: 32: Hoare triple {4037#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); srcloc: L1014 {4038#(not (= 0 |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:28,710 INFO L280 TraceCheckUtils]: 33: Hoare triple {4038#(not (= 0 |main_#t~mem5.base|))} ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; {4039#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:28,712 INFO L280 TraceCheckUtils]: 34: Hoare triple {4039#(not (= 0 main_~x~0.base))} havoc #t~mem5.base, #t~mem5.offset; {4039#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 19:04:28,712 INFO L280 TraceCheckUtils]: 35: Hoare triple {4039#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4023#false} is VALID [2020-07-10 19:04:28,713 INFO L280 TraceCheckUtils]: 36: Hoare triple {4023#false} assume !false; {4023#false} is VALID [2020-07-10 19:04:28,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:04:28,722 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:28,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553536575] [2020-07-10 19:04:28,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:28,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:04:28,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542698785] [2020-07-10 19:04:28,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-10 19:04:28,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:28,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:04:28,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:28,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:04:28,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:04:28,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:04:28,802 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 14 states. [2020-07-10 19:04:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:32,364 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2020-07-10 19:04:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 19:04:32,365 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2020-07-10 19:04:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2020-07-10 19:04:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2020-07-10 19:04:32,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 181 transitions. [2020-07-10 19:04:32,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:32,621 INFO L225 Difference]: With dead ends: 210 [2020-07-10 19:04:32,621 INFO L226 Difference]: Without dead ends: 208 [2020-07-10 19:04:32,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2020-07-10 19:04:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-07-10 19:04:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 134. [2020-07-10 19:04:33,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:33,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 134 states. [2020-07-10 19:04:33,356 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 134 states. [2020-07-10 19:04:33,356 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 134 states. [2020-07-10 19:04:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:33,362 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2020-07-10 19:04:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2020-07-10 19:04:33,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:33,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:33,363 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 208 states. [2020-07-10 19:04:33,363 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 208 states. [2020-07-10 19:04:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:33,369 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2020-07-10 19:04:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2020-07-10 19:04:33,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:33,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:33,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:33,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-10 19:04:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2020-07-10 19:04:33,375 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 37 [2020-07-10 19:04:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:33,375 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2020-07-10 19:04:33,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:04:33,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 134 states and 145 transitions. [2020-07-10 19:04:33,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2020-07-10 19:04:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 19:04:33,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:33,733 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] [2020-07-10 19:04:33,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:04:33,733 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:04:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1168005107, now seen corresponding path program 1 times [2020-07-10 19:04:33,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:33,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834842844] [2020-07-10 19:04:33,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:04:33,837 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:33,837 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 19:04:33,837 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 19:04:33,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:04:33,856 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: L985 has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 19:04:33,857 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L986-1 has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L987 has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L990 has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L1012-4 has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L1012-4 has no Hoare annotation [2020-07-10 19:04:33,858 WARN L170 areAnnotationChecker]: L993-5 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L993-1 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L993-1 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L993-2 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L993-4 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L1016-1 has no Hoare annotation [2020-07-10 19:04:33,859 WARN L170 areAnnotationChecker]: L996-1 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L996-2 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:33,860 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1019-5 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L997-1 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-10 19:04:33,861 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1021-25 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1021-25 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L998-1 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-10 19:04:33,862 WARN L170 areAnnotationChecker]: L1021-26 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1000 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1000 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1027-5 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1022 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-10 19:04:33,863 WARN L170 areAnnotationChecker]: L1000-2 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1022-1 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: L1000-3 has no Hoare annotation [2020-07-10 19:04:33,864 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1021-9 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1021-9 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1012-3 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1012-3 has no Hoare annotation [2020-07-10 19:04:33,865 WARN L170 areAnnotationChecker]: L1012-3 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1021-10 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1021-18 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2020-07-10 19:04:33,866 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1021-11 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1021-19 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1021-12 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1021-20 has no Hoare annotation [2020-07-10 19:04:33,867 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-13 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-21 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-14 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-22 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-15 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-23 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-16 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-16 has no Hoare annotation [2020-07-10 19:04:33,868 WARN L170 areAnnotationChecker]: L1021-24 has no Hoare annotation [2020-07-10 19:04:33,869 WARN L170 areAnnotationChecker]: L1021-24 has no Hoare annotation [2020-07-10 19:04:33,869 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:33,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:04:33 BoogieIcfgContainer [2020-07-10 19:04:33,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:04:33,875 INFO L168 Benchmark]: Toolchain (without parser) took 19765.05 ms. Allocated memory was 135.8 MB in the beginning and 430.4 MB in the end (delta: 294.6 MB). Free memory was 99.2 MB in the beginning and 107.5 MB in the end (delta: -8.4 MB). Peak memory consumption was 286.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:33,876 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 19:04:33,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.36 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 165.6 MB in the end (delta: -66.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:33,878 INFO L168 Benchmark]: Boogie Preprocessor took 69.49 ms. Allocated memory is still 200.3 MB. Free memory was 165.6 MB in the beginning and 162.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:33,878 INFO L168 Benchmark]: RCFGBuilder took 814.65 ms. Allocated memory is still 200.3 MB. Free memory was 162.0 MB in the beginning and 98.9 MB in the end (delta: 63.1 MB). Peak memory consumption was 63.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:33,879 INFO L168 Benchmark]: TraceAbstraction took 18273.64 ms. Allocated memory was 200.3 MB in the beginning and 430.4 MB in the end (delta: 230.2 MB). Free memory was 98.9 MB in the beginning and 107.5 MB in the end (delta: -8.6 MB). Peak memory consumption was 221.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:04:33,882 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.17 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 601.36 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 165.6 MB in the end (delta: -66.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.49 ms. Allocated memory is still 200.3 MB. Free memory was 165.6 MB in the beginning and 162.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.65 ms. Allocated memory is still 200.3 MB. Free memory was 162.0 MB in the beginning and 98.9 MB in the end (delta: 63.1 MB). Peak memory consumption was 63.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18273.64 ms. Allocated memory was 200.3 MB in the beginning and 430.4 MB in the end (delta: 230.2 MB). Free memory was 98.9 MB in the beginning and 107.5 MB in the end (delta: -8.6 MB). Peak memory consumption was 221.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1021]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = head [L987] head->data = 0 [L989] SLL* x = head; [L990] int state = 1; [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state [L1016] EXPR head->next [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) [L1019] EXPR x->data [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] EXPR x->data [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.1s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 499 SDtfs, 1195 SDslu, 1936 SDs, 0 SdLazy, 1232 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 269 StatesRemovedByMinimization, 5 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...