/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:10:17,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:10:17,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:10:17,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:10:17,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:10:17,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:10:17,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:10:17,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:10:17,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:10:17,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:10:17,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:10:17,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:10:17,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:10:17,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:10:17,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:10:17,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:10:17,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:10:17,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:10:17,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:10:17,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:10:17,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:10:17,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:10:17,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:10:17,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:10:17,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:10:17,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:10:17,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:10:17,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:10:17,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:10:17,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:10:17,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:10:17,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:10:17,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:10:17,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:10:17,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:10:17,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:10:17,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:10:17,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:10:17,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:10:17,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:10:17,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:10:17,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:10:17,755 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:10:17,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:10:17,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:10:17,758 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:10:17,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:10:17,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:10:17,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:10:17,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:10:17,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:10:17,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:10:17,760 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:10:17,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:10:17,761 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:10:17,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:10:17,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:10:17,762 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:10:17,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:10:17,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:10:17,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:10:17,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:10:17,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:10:17,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:10:17,763 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:10:18,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:10:18,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:10:18,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:10:18,087 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:10:18,088 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:10:18,088 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-11 01:10:18,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc996284/052f8811c91149c482d08abd7d0462b2/FLAG2489a12db [2020-07-11 01:10:18,805 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:10:18,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-11 01:10:18,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc996284/052f8811c91149c482d08abd7d0462b2/FLAG2489a12db [2020-07-11 01:10:19,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc996284/052f8811c91149c482d08abd7d0462b2 [2020-07-11 01:10:19,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:10:19,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:10:19,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:10:19,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:10:19,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:10:19,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e56cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19, skipping insertion in model container [2020-07-11 01:10:19,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:10:19,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:10:19,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:10:19,639 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:10:19,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:10:19,772 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:10:19,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19 WrapperNode [2020-07-11 01:10:19,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:10:19,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:10:19,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:10:19,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:10:19,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (1/1) ... [2020-07-11 01:10:19,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:10:19,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:10:19,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:10:19,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:10:19,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (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-11 01:10:19,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:10:19,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:10:19,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-11 01:10:19,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-11 01:10:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-11 01:10:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-07-11 01:10:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-07-11 01:10:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-07-11 01:10:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:10:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:10:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:10:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-11 01:10:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-11 01:10:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:10:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:10:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:10:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:10:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:10:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:10:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:10:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:10:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:10:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:10:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:10:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:10:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:10:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:10:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:10:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:10:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:10:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:10:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:10:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:10:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:10:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:10:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:10:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:10:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:10:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:10:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:10:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:10:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:10:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:10:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:10:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:10:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:10:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:10:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:10:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:10:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:10:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:10:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:10:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:10:19,926 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:10:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:10:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:10:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:10:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:10:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:10:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:10:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:10:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:10:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:10:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:10:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:10:19,930 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:10:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:10:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:10:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:10:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:10:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:10:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:10:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:10:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:10:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:10:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:10:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:10:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:10:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:10:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:10:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:10:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:10:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:10:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:10:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:10:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-11 01:10:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-07-11 01:10:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:10:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:10:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-07-11 01:10:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:10:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-07-11 01:10:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:10:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:10:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:10:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:10:20,323 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-11 01:10:20,678 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:10:20,679 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 01:10:20,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:10:20 BoogieIcfgContainer [2020-07-11 01:10:20,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:10:20,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:10:20,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:10:20,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:10:20,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:10:19" (1/3) ... [2020-07-11 01:10:20,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3a189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:10:20, skipping insertion in model container [2020-07-11 01:10:20,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:10:19" (2/3) ... [2020-07-11 01:10:20,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3a189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:10:20, skipping insertion in model container [2020-07-11 01:10:20,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:10:20" (3/3) ... [2020-07-11 01:10:20,693 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-07-11 01:10:20,704 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:10:20,714 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:10:20,729 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:10:20,750 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:10:20,750 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:10:20,750 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:10:20,750 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:10:20,750 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:10:20,751 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:10:20,751 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:10:20,751 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:10:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-07-11 01:10:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 01:10:20,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:20,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:20,783 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1731717969, now seen corresponding path program 1 times [2020-07-11 01:10:20,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:20,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [874372358] [2020-07-11 01:10:20,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:21,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {78#true} is VALID [2020-07-11 01:10:21,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-11 01:10:21,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-11 01:10:21,022 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-11 01:10:21,022 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {78#true} {78#true} #147#return; {78#true} is VALID [2020-07-11 01:10:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:21,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {78#true} is VALID [2020-07-11 01:10:21,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} ~head~0.base, ~head~0.offset := 0, 0; {78#true} is VALID [2020-07-11 01:10:21,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !(~len > 0); {78#true} is VALID [2020-07-11 01:10:21,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {78#true} is VALID [2020-07-11 01:10:21,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-11 01:10:21,067 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {79#false} #141#return; {79#false} is VALID [2020-07-11 01:10:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:21,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {78#true} is VALID [2020-07-11 01:10:21,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} ~len~0 := 0; {78#true} is VALID [2020-07-11 01:10:21,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !(~head.base != 0 || ~head.offset != 0); {78#true} is VALID [2020-07-11 01:10:21,082 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} #res := ~len~0; {78#true} is VALID [2020-07-11 01:10:21,083 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-11 01:10:21,083 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {79#false} #143#return; {79#false} is VALID [2020-07-11 01:10:21,085 INFO L263 TraceCheckUtils]: 0: Hoare triple {78#true} call ULTIMATE.init(); {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:21,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {78#true} is VALID [2020-07-11 01:10:21,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-11 01:10:21,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-11 01:10:21,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-11 01:10:21,087 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {78#true} #147#return; {78#true} is VALID [2020-07-11 01:10:21,087 INFO L263 TraceCheckUtils]: 6: Hoare triple {78#true} call #t~ret12 := main(); {78#true} is VALID [2020-07-11 01:10:21,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {78#true} ~len~1 := 2; {78#true} is VALID [2020-07-11 01:10:21,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-11 01:10:21,089 INFO L263 TraceCheckUtils]: 9: Hoare triple {79#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {98#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:21,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {98#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {78#true} is VALID [2020-07-11 01:10:21,090 INFO L280 TraceCheckUtils]: 11: Hoare triple {78#true} ~head~0.base, ~head~0.offset := 0, 0; {78#true} is VALID [2020-07-11 01:10:21,090 INFO L280 TraceCheckUtils]: 12: Hoare triple {78#true} assume !(~len > 0); {78#true} is VALID [2020-07-11 01:10:21,091 INFO L280 TraceCheckUtils]: 13: Hoare triple {78#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {78#true} is VALID [2020-07-11 01:10:21,091 INFO L280 TraceCheckUtils]: 14: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-11 01:10:21,091 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {78#true} {79#false} #141#return; {79#false} is VALID [2020-07-11 01:10:21,091 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {79#false} is VALID [2020-07-11 01:10:21,092 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#false} havoc #t~ret10.base, #t~ret10.offset; {79#false} is VALID [2020-07-11 01:10:21,092 INFO L263 TraceCheckUtils]: 18: Hoare triple {79#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {78#true} is VALID [2020-07-11 01:10:21,093 INFO L280 TraceCheckUtils]: 19: Hoare triple {78#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {78#true} is VALID [2020-07-11 01:10:21,093 INFO L280 TraceCheckUtils]: 20: Hoare triple {78#true} ~len~0 := 0; {78#true} is VALID [2020-07-11 01:10:21,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {78#true} assume !(~head.base != 0 || ~head.offset != 0); {78#true} is VALID [2020-07-11 01:10:21,094 INFO L280 TraceCheckUtils]: 22: Hoare triple {78#true} #res := ~len~0; {78#true} is VALID [2020-07-11 01:10:21,094 INFO L280 TraceCheckUtils]: 23: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-11 01:10:21,094 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {78#true} {79#false} #143#return; {79#false} is VALID [2020-07-11 01:10:21,094 INFO L280 TraceCheckUtils]: 25: Hoare triple {79#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {79#false} is VALID [2020-07-11 01:10:21,095 INFO L280 TraceCheckUtils]: 26: Hoare triple {79#false} assume ~len~1 != #t~ret11; {79#false} is VALID [2020-07-11 01:10:21,095 INFO L280 TraceCheckUtils]: 27: Hoare triple {79#false} havoc #t~ret11; {79#false} is VALID [2020-07-11 01:10:21,095 INFO L280 TraceCheckUtils]: 28: Hoare triple {79#false} assume !false; {79#false} is VALID [2020-07-11 01:10:21,101 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-11 01:10:21,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [874372358] [2020-07-11 01:10:21,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:21,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:10:21,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215335114] [2020-07-11 01:10:21,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-11 01:10:21,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:21,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:10:21,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:21,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:10:21,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:10:21,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:10:21,185 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2020-07-11 01:10:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:22,009 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2020-07-11 01:10:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:10:22,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-11 01:10:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:10:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2020-07-11 01:10:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:10:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2020-07-11 01:10:22,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2020-07-11 01:10:22,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:22,308 INFO L225 Difference]: With dead ends: 154 [2020-07-11 01:10:22,308 INFO L226 Difference]: Without dead ends: 68 [2020-07-11 01:10:22,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-11 01:10:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-11 01:10:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2020-07-11 01:10:22,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:22,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 55 states. [2020-07-11 01:10:22,441 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 55 states. [2020-07-11 01:10:22,441 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 55 states. [2020-07-11 01:10:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:22,449 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-11 01:10:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-11 01:10:22,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:22,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:22,451 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 68 states. [2020-07-11 01:10:22,451 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 68 states. [2020-07-11 01:10:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:22,457 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-11 01:10:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-11 01:10:22,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:22,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:22,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:22,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-11 01:10:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-11 01:10:22,464 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 29 [2020-07-11 01:10:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:22,465 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-11 01:10:22,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:10:22,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-11 01:10:22,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-11 01:10:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 01:10:22,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:22,554 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-11 01:10:22,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:10:22,555 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash 632987872, now seen corresponding path program 1 times [2020-07-11 01:10:22,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:22,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [572352516] [2020-07-11 01:10:22,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:22,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {679#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {658#true} is VALID [2020-07-11 01:10:22,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} #valid := #valid[0 := 0]; {658#true} is VALID [2020-07-11 01:10:22,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume 0 < #StackHeapBarrier; {658#true} is VALID [2020-07-11 01:10:22,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-11 01:10:22,646 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {658#true} {658#true} #147#return; {658#true} is VALID [2020-07-11 01:10:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:22,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {680#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {658#true} is VALID [2020-07-11 01:10:22,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} ~head~0.base, ~head~0.offset := 0, 0; {658#true} is VALID [2020-07-11 01:10:22,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume !(~len > 0); {658#true} is VALID [2020-07-11 01:10:22,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {658#true} is VALID [2020-07-11 01:10:22,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-11 01:10:22,678 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {659#false} #141#return; {659#false} is VALID [2020-07-11 01:10:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:22,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {658#true} is VALID [2020-07-11 01:10:22,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} ~len~0 := 0; {658#true} is VALID [2020-07-11 01:10:22,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2020-07-11 01:10:22,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2020-07-11 01:10:22,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-11 01:10:22,689 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {659#false} #143#return; {659#false} is VALID [2020-07-11 01:10:22,690 INFO L263 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {679#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:22,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {658#true} is VALID [2020-07-11 01:10:22,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} #valid := #valid[0 := 0]; {658#true} is VALID [2020-07-11 01:10:22,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} assume 0 < #StackHeapBarrier; {658#true} is VALID [2020-07-11 01:10:22,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-11 01:10:22,692 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {658#true} #147#return; {658#true} is VALID [2020-07-11 01:10:22,692 INFO L263 TraceCheckUtils]: 6: Hoare triple {658#true} call #t~ret12 := main(); {658#true} is VALID [2020-07-11 01:10:22,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {658#true} ~len~1 := 2; {665#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:22,694 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#(<= main_~len~1 2)} #t~short8 := ~len~1 < 32; {666#|main_#t~short8|} is VALID [2020-07-11 01:10:22,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {666#|main_#t~short8|} assume !#t~short8; {659#false} is VALID [2020-07-11 01:10:22,695 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#false} assume !#t~short8; {659#false} is VALID [2020-07-11 01:10:22,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {659#false} havoc #t~nondet7; {659#false} is VALID [2020-07-11 01:10:22,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {659#false} havoc #t~short8; {659#false} is VALID [2020-07-11 01:10:22,696 INFO L263 TraceCheckUtils]: 13: Hoare triple {659#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {680#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:22,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {658#true} is VALID [2020-07-11 01:10:22,696 INFO L280 TraceCheckUtils]: 15: Hoare triple {658#true} ~head~0.base, ~head~0.offset := 0, 0; {658#true} is VALID [2020-07-11 01:10:22,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {658#true} assume !(~len > 0); {658#true} is VALID [2020-07-11 01:10:22,697 INFO L280 TraceCheckUtils]: 17: Hoare triple {658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {658#true} is VALID [2020-07-11 01:10:22,697 INFO L280 TraceCheckUtils]: 18: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-11 01:10:22,698 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {658#true} {659#false} #141#return; {659#false} is VALID [2020-07-11 01:10:22,698 INFO L280 TraceCheckUtils]: 20: Hoare triple {659#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2020-07-11 01:10:22,698 INFO L280 TraceCheckUtils]: 21: Hoare triple {659#false} havoc #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2020-07-11 01:10:22,698 INFO L263 TraceCheckUtils]: 22: Hoare triple {659#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {658#true} is VALID [2020-07-11 01:10:22,699 INFO L280 TraceCheckUtils]: 23: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {658#true} is VALID [2020-07-11 01:10:22,699 INFO L280 TraceCheckUtils]: 24: Hoare triple {658#true} ~len~0 := 0; {658#true} is VALID [2020-07-11 01:10:22,699 INFO L280 TraceCheckUtils]: 25: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2020-07-11 01:10:22,700 INFO L280 TraceCheckUtils]: 26: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2020-07-11 01:10:22,700 INFO L280 TraceCheckUtils]: 27: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-11 01:10:22,700 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {658#true} {659#false} #143#return; {659#false} is VALID [2020-07-11 01:10:22,700 INFO L280 TraceCheckUtils]: 29: Hoare triple {659#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {659#false} is VALID [2020-07-11 01:10:22,702 INFO L280 TraceCheckUtils]: 30: Hoare triple {659#false} assume ~len~1 != #t~ret11; {659#false} is VALID [2020-07-11 01:10:22,703 INFO L280 TraceCheckUtils]: 31: Hoare triple {659#false} havoc #t~ret11; {659#false} is VALID [2020-07-11 01:10:22,703 INFO L280 TraceCheckUtils]: 32: Hoare triple {659#false} assume !false; {659#false} is VALID [2020-07-11 01:10:22,705 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-11 01:10:22,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [572352516] [2020-07-11 01:10:22,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:22,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:10:22,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758600287] [2020-07-11 01:10:22,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-11 01:10:22,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:22,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:10:22,781 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-11 01:10:22,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:10:22,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:22,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:10:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:10:22,783 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2020-07-11 01:10:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:23,857 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-07-11 01:10:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:10:23,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-11 01:10:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:10:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2020-07-11 01:10:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:10:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2020-07-11 01:10:23,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 154 transitions. [2020-07-11 01:10:24,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:24,079 INFO L225 Difference]: With dead ends: 143 [2020-07-11 01:10:24,079 INFO L226 Difference]: Without dead ends: 96 [2020-07-11 01:10:24,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:10:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-11 01:10:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2020-07-11 01:10:24,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:24,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 57 states. [2020-07-11 01:10:24,196 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 57 states. [2020-07-11 01:10:24,197 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 57 states. [2020-07-11 01:10:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:24,206 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-11 01:10:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-11 01:10:24,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:24,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:24,211 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 96 states. [2020-07-11 01:10:24,211 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 96 states. [2020-07-11 01:10:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:24,228 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-11 01:10:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-11 01:10:24,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:24,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:24,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:24,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-11 01:10:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-11 01:10:24,236 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 33 [2020-07-11 01:10:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:24,237 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-11 01:10:24,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:10:24,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-11 01:10:24,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-11 01:10:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 01:10:24,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:24,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:24,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:10:24,330 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1134974621, now seen corresponding path program 1 times [2020-07-11 01:10:24,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:24,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436833122] [2020-07-11 01:10:24,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:24,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {1304#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1284#true} is VALID [2020-07-11 01:10:24,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} #valid := #valid[0 := 0]; {1284#true} is VALID [2020-07-11 01:10:24,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume 0 < #StackHeapBarrier; {1284#true} is VALID [2020-07-11 01:10:24,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-11 01:10:24,485 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1284#true} {1284#true} #147#return; {1284#true} is VALID [2020-07-11 01:10:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:24,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {1305#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:24,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:24,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:24,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {1307#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:24,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {1307#(<= |sll_create_#in~len| 0)} assume true; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:24,558 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1307#(<= |sll_create_#in~len| 0)} {1291#(<= 2 main_~len~1)} #141#return; {1285#false} is VALID [2020-07-11 01:10:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:24,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1284#true} is VALID [2020-07-11 01:10:24,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} ~len~0 := 0; {1284#true} is VALID [2020-07-11 01:10:24,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume !(~head.base != 0 || ~head.offset != 0); {1284#true} is VALID [2020-07-11 01:10:24,572 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} #res := ~len~0; {1284#true} is VALID [2020-07-11 01:10:24,572 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-11 01:10:24,572 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1284#true} {1285#false} #143#return; {1285#false} is VALID [2020-07-11 01:10:24,574 INFO L263 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1304#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:24,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {1304#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1284#true} is VALID [2020-07-11 01:10:24,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} #valid := #valid[0 := 0]; {1284#true} is VALID [2020-07-11 01:10:24,575 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume 0 < #StackHeapBarrier; {1284#true} is VALID [2020-07-11 01:10:24,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-11 01:10:24,576 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1284#true} {1284#true} #147#return; {1284#true} is VALID [2020-07-11 01:10:24,576 INFO L263 TraceCheckUtils]: 6: Hoare triple {1284#true} call #t~ret12 := main(); {1284#true} is VALID [2020-07-11 01:10:24,577 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} ~len~1 := 2; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,578 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,578 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(<= 2 main_~len~1)} assume #t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {1291#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {1291#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,581 INFO L280 TraceCheckUtils]: 12: Hoare triple {1291#(<= 2 main_~len~1)} assume !#t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,582 INFO L280 TraceCheckUtils]: 13: Hoare triple {1291#(<= 2 main_~len~1)} havoc #t~nondet7; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {1291#(<= 2 main_~len~1)} havoc #t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:24,584 INFO L263 TraceCheckUtils]: 15: Hoare triple {1291#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1305#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:24,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {1305#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:24,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:24,587 INFO L280 TraceCheckUtils]: 18: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:24,587 INFO L280 TraceCheckUtils]: 19: Hoare triple {1307#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:24,588 INFO L280 TraceCheckUtils]: 20: Hoare triple {1307#(<= |sll_create_#in~len| 0)} assume true; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:24,590 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1307#(<= |sll_create_#in~len| 0)} {1291#(<= 2 main_~len~1)} #141#return; {1285#false} is VALID [2020-07-11 01:10:24,590 INFO L280 TraceCheckUtils]: 22: Hoare triple {1285#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {1285#false} is VALID [2020-07-11 01:10:24,591 INFO L280 TraceCheckUtils]: 23: Hoare triple {1285#false} havoc #t~ret10.base, #t~ret10.offset; {1285#false} is VALID [2020-07-11 01:10:24,591 INFO L263 TraceCheckUtils]: 24: Hoare triple {1285#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1284#true} is VALID [2020-07-11 01:10:24,591 INFO L280 TraceCheckUtils]: 25: Hoare triple {1284#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1284#true} is VALID [2020-07-11 01:10:24,592 INFO L280 TraceCheckUtils]: 26: Hoare triple {1284#true} ~len~0 := 0; {1284#true} is VALID [2020-07-11 01:10:24,592 INFO L280 TraceCheckUtils]: 27: Hoare triple {1284#true} assume !(~head.base != 0 || ~head.offset != 0); {1284#true} is VALID [2020-07-11 01:10:24,592 INFO L280 TraceCheckUtils]: 28: Hoare triple {1284#true} #res := ~len~0; {1284#true} is VALID [2020-07-11 01:10:24,592 INFO L280 TraceCheckUtils]: 29: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-11 01:10:24,593 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1284#true} {1285#false} #143#return; {1285#false} is VALID [2020-07-11 01:10:24,593 INFO L280 TraceCheckUtils]: 31: Hoare triple {1285#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1285#false} is VALID [2020-07-11 01:10:24,593 INFO L280 TraceCheckUtils]: 32: Hoare triple {1285#false} assume ~len~1 != #t~ret11; {1285#false} is VALID [2020-07-11 01:10:24,594 INFO L280 TraceCheckUtils]: 33: Hoare triple {1285#false} havoc #t~ret11; {1285#false} is VALID [2020-07-11 01:10:24,594 INFO L280 TraceCheckUtils]: 34: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-11 01:10:24,597 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-11 01:10:24,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436833122] [2020-07-11 01:10:24,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:24,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:10:24,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480189071] [2020-07-11 01:10:24,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-11 01:10:24,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:24,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:10:24,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:24,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:10:24,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:24,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:10:24,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:10:24,661 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 7 states. [2020-07-11 01:10:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:25,672 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-11 01:10:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 01:10:25,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-11 01:10:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:10:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-11 01:10:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:10:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-11 01:10:25,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 121 transitions. [2020-07-11 01:10:25,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:25,838 INFO L225 Difference]: With dead ends: 114 [2020-07-11 01:10:25,838 INFO L226 Difference]: Without dead ends: 94 [2020-07-11 01:10:25,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:10:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-11 01:10:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2020-07-11 01:10:25,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:25,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 67 states. [2020-07-11 01:10:25,956 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 67 states. [2020-07-11 01:10:25,956 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 67 states. [2020-07-11 01:10:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:25,963 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-11 01:10:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-11 01:10:25,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:25,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:25,965 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 94 states. [2020-07-11 01:10:25,965 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 94 states. [2020-07-11 01:10:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:25,972 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-11 01:10:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-11 01:10:25,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:25,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:25,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:25,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-11 01:10:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-07-11 01:10:25,978 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 35 [2020-07-11 01:10:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:25,978 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-07-11 01:10:25,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:10:25,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 73 transitions. [2020-07-11 01:10:26,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-07-11 01:10:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 01:10:26,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:26,086 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:26,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:10:26,086 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash 226602169, now seen corresponding path program 1 times [2020-07-11 01:10:26,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:26,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [158253628] [2020-07-11 01:10:26,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:26,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1869#true} is VALID [2020-07-11 01:10:26,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} #valid := #valid[0 := 0]; {1869#true} is VALID [2020-07-11 01:10:26,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume 0 < #StackHeapBarrier; {1869#true} is VALID [2020-07-11 01:10:26,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-11 01:10:26,218 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1869#true} {1869#true} #147#return; {1869#true} is VALID [2020-07-11 01:10:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:26,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {1893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1869#true} is VALID [2020-07-11 01:10:26,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} ~head~0.base, ~head~0.offset := 0, 0; {1869#true} is VALID [2020-07-11 01:10:26,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume !(~len > 0); {1869#true} is VALID [2020-07-11 01:10:26,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1869#true} is VALID [2020-07-11 01:10:26,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-11 01:10:26,263 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1870#false} #141#return; {1870#false} is VALID [2020-07-11 01:10:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:26,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {1869#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1869#true} is VALID [2020-07-11 01:10:26,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} ~len~0 := 0; {1869#true} is VALID [2020-07-11 01:10:26,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume !(~head.base != 0 || ~head.offset != 0); {1869#true} is VALID [2020-07-11 01:10:26,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} #res := ~len~0; {1869#true} is VALID [2020-07-11 01:10:26,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-11 01:10:26,282 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1870#false} #143#return; {1870#false} is VALID [2020-07-11 01:10:26,283 INFO L263 TraceCheckUtils]: 0: Hoare triple {1869#true} call ULTIMATE.init(); {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:26,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1869#true} is VALID [2020-07-11 01:10:26,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} #valid := #valid[0 := 0]; {1869#true} is VALID [2020-07-11 01:10:26,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} assume 0 < #StackHeapBarrier; {1869#true} is VALID [2020-07-11 01:10:26,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-11 01:10:26,285 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1869#true} #147#return; {1869#true} is VALID [2020-07-11 01:10:26,285 INFO L263 TraceCheckUtils]: 6: Hoare triple {1869#true} call #t~ret12 := main(); {1869#true} is VALID [2020-07-11 01:10:26,285 INFO L280 TraceCheckUtils]: 7: Hoare triple {1869#true} ~len~1 := 2; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,286 INFO L280 TraceCheckUtils]: 8: Hoare triple {1876#(<= main_~len~1 2)} #t~short8 := ~len~1 < 32; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {1876#(<= main_~len~1 2)} assume #t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {1876#(<= main_~len~1 2)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {1876#(<= main_~len~1 2)} #t~short8 := 0 != #t~nondet7; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {1876#(<= main_~len~1 2)} assume !!#t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {1876#(<= main_~len~1 2)} havoc #t~nondet7; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {1876#(<= main_~len~1 2)} havoc #t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-11 01:10:26,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {1876#(<= main_~len~1 2)} #t~post9 := ~len~1; {1877#(<= |main_#t~post9| 2)} is VALID [2020-07-11 01:10:26,291 INFO L280 TraceCheckUtils]: 16: Hoare triple {1877#(<= |main_#t~post9| 2)} ~len~1 := 1 + #t~post9; {1878#(<= main_~len~1 3)} is VALID [2020-07-11 01:10:26,292 INFO L280 TraceCheckUtils]: 17: Hoare triple {1878#(<= main_~len~1 3)} havoc #t~post9; {1878#(<= main_~len~1 3)} is VALID [2020-07-11 01:10:26,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {1878#(<= main_~len~1 3)} #t~short8 := ~len~1 < 32; {1879#|main_#t~short8|} is VALID [2020-07-11 01:10:26,293 INFO L280 TraceCheckUtils]: 19: Hoare triple {1879#|main_#t~short8|} assume !#t~short8; {1870#false} is VALID [2020-07-11 01:10:26,293 INFO L280 TraceCheckUtils]: 20: Hoare triple {1870#false} assume !#t~short8; {1870#false} is VALID [2020-07-11 01:10:26,294 INFO L280 TraceCheckUtils]: 21: Hoare triple {1870#false} havoc #t~nondet7; {1870#false} is VALID [2020-07-11 01:10:26,294 INFO L280 TraceCheckUtils]: 22: Hoare triple {1870#false} havoc #t~short8; {1870#false} is VALID [2020-07-11 01:10:26,294 INFO L263 TraceCheckUtils]: 23: Hoare triple {1870#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:26,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {1893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1869#true} is VALID [2020-07-11 01:10:26,295 INFO L280 TraceCheckUtils]: 25: Hoare triple {1869#true} ~head~0.base, ~head~0.offset := 0, 0; {1869#true} is VALID [2020-07-11 01:10:26,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {1869#true} assume !(~len > 0); {1869#true} is VALID [2020-07-11 01:10:26,295 INFO L280 TraceCheckUtils]: 27: Hoare triple {1869#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1869#true} is VALID [2020-07-11 01:10:26,295 INFO L280 TraceCheckUtils]: 28: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-11 01:10:26,296 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1869#true} {1870#false} #141#return; {1870#false} is VALID [2020-07-11 01:10:26,296 INFO L280 TraceCheckUtils]: 30: Hoare triple {1870#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {1870#false} is VALID [2020-07-11 01:10:26,296 INFO L280 TraceCheckUtils]: 31: Hoare triple {1870#false} havoc #t~ret10.base, #t~ret10.offset; {1870#false} is VALID [2020-07-11 01:10:26,296 INFO L263 TraceCheckUtils]: 32: Hoare triple {1870#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1869#true} is VALID [2020-07-11 01:10:26,297 INFO L280 TraceCheckUtils]: 33: Hoare triple {1869#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1869#true} is VALID [2020-07-11 01:10:26,297 INFO L280 TraceCheckUtils]: 34: Hoare triple {1869#true} ~len~0 := 0; {1869#true} is VALID [2020-07-11 01:10:26,297 INFO L280 TraceCheckUtils]: 35: Hoare triple {1869#true} assume !(~head.base != 0 || ~head.offset != 0); {1869#true} is VALID [2020-07-11 01:10:26,297 INFO L280 TraceCheckUtils]: 36: Hoare triple {1869#true} #res := ~len~0; {1869#true} is VALID [2020-07-11 01:10:26,297 INFO L280 TraceCheckUtils]: 37: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-11 01:10:26,298 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1869#true} {1870#false} #143#return; {1870#false} is VALID [2020-07-11 01:10:26,298 INFO L280 TraceCheckUtils]: 39: Hoare triple {1870#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1870#false} is VALID [2020-07-11 01:10:26,298 INFO L280 TraceCheckUtils]: 40: Hoare triple {1870#false} assume ~len~1 != #t~ret11; {1870#false} is VALID [2020-07-11 01:10:26,299 INFO L280 TraceCheckUtils]: 41: Hoare triple {1870#false} havoc #t~ret11; {1870#false} is VALID [2020-07-11 01:10:26,299 INFO L280 TraceCheckUtils]: 42: Hoare triple {1870#false} assume !false; {1870#false} is VALID [2020-07-11 01:10:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:10:26,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [158253628] [2020-07-11 01:10:26,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:26,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 01:10:26,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983203177] [2020-07-11 01:10:26,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-07-11 01:10:26,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:26,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:10:26,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:26,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:10:26,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:26,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:10:26,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:10:26,343 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2020-07-11 01:10:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:27,780 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2020-07-11 01:10:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 01:10:27,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-07-11 01:10:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:10:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2020-07-11 01:10:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:10:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2020-07-11 01:10:27,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2020-07-11 01:10:28,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:28,015 INFO L225 Difference]: With dead ends: 168 [2020-07-11 01:10:28,015 INFO L226 Difference]: Without dead ends: 117 [2020-07-11 01:10:28,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:10:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-11 01:10:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2020-07-11 01:10:28,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:28,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 74 states. [2020-07-11 01:10:28,169 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 74 states. [2020-07-11 01:10:28,169 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 74 states. [2020-07-11 01:10:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:28,175 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-11 01:10:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-11 01:10:28,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:28,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:28,177 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 117 states. [2020-07-11 01:10:28,177 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 117 states. [2020-07-11 01:10:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:28,183 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-11 01:10:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-11 01:10:28,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:28,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:28,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:28,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-11 01:10:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2020-07-11 01:10:28,188 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 43 [2020-07-11 01:10:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:28,188 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2020-07-11 01:10:28,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:10:28,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 80 transitions. [2020-07-11 01:10:28,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2020-07-11 01:10:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 01:10:28,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:28,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:28,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:10:28,320 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash 360366586, now seen corresponding path program 1 times [2020-07-11 01:10:28,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:28,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611468269] [2020-07-11 01:10:28,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:28,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {2661#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2631#true} is VALID [2020-07-11 01:10:28,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {2631#true} #valid := #valid[0 := 0]; {2631#true} is VALID [2020-07-11 01:10:28,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} assume 0 < #StackHeapBarrier; {2631#true} is VALID [2020-07-11 01:10:28,400 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} assume true; {2631#true} is VALID [2020-07-11 01:10:28,401 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2631#true} {2631#true} #147#return; {2631#true} is VALID [2020-07-11 01:10:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:28,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {2662#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {2631#true} is VALID [2020-07-11 01:10:28,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {2631#true} ~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2020-07-11 01:10:28,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} assume !!(~len > 0); {2631#true} is VALID [2020-07-11 01:10:28,491 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {2663#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-11 01:10:28,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {2663#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:28,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:28,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:28,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,496 INFO L280 TraceCheckUtils]: 12: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-11 01:10:28,496 INFO L280 TraceCheckUtils]: 13: Hoare triple {2666#(not (= 0 |sll_create_#res.base|))} assume true; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-11 01:10:28,497 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2666#(not (= 0 |sll_create_#res.base|))} {2631#true} #141#return; {2653#(not (= 0 |main_#t~ret10.base|))} is VALID [2020-07-11 01:10:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:28,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {2631#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-11 01:10:28,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} ~len~0 := 0; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-11 01:10:28,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-11 01:10:28,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-11 01:10:28,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} assume true; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-11 01:10:28,552 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2668#(= 0 |sll_length_#in~head.base|)} {2654#(not (= 0 main_~s~0.base))} #143#return; {2632#false} is VALID [2020-07-11 01:10:28,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2661#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:28,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {2661#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2631#true} is VALID [2020-07-11 01:10:28,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} #valid := #valid[0 := 0]; {2631#true} is VALID [2020-07-11 01:10:28,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} assume 0 < #StackHeapBarrier; {2631#true} is VALID [2020-07-11 01:10:28,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {2631#true} assume true; {2631#true} is VALID [2020-07-11 01:10:28,555 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2631#true} {2631#true} #147#return; {2631#true} is VALID [2020-07-11 01:10:28,556 INFO L263 TraceCheckUtils]: 6: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2020-07-11 01:10:28,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {2631#true} ~len~1 := 2; {2631#true} is VALID [2020-07-11 01:10:28,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {2631#true} #t~short8 := ~len~1 < 32; {2631#true} is VALID [2020-07-11 01:10:28,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {2631#true} assume #t~short8; {2631#true} is VALID [2020-07-11 01:10:28,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {2631#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2631#true} is VALID [2020-07-11 01:10:28,557 INFO L280 TraceCheckUtils]: 11: Hoare triple {2631#true} #t~short8 := 0 != #t~nondet7; {2631#true} is VALID [2020-07-11 01:10:28,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {2631#true} assume !#t~short8; {2631#true} is VALID [2020-07-11 01:10:28,557 INFO L280 TraceCheckUtils]: 13: Hoare triple {2631#true} havoc #t~nondet7; {2631#true} is VALID [2020-07-11 01:10:28,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {2631#true} havoc #t~short8; {2631#true} is VALID [2020-07-11 01:10:28,559 INFO L263 TraceCheckUtils]: 15: Hoare triple {2631#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {2662#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:28,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {2662#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {2631#true} is VALID [2020-07-11 01:10:28,559 INFO L280 TraceCheckUtils]: 17: Hoare triple {2631#true} ~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2020-07-11 01:10:28,560 INFO L280 TraceCheckUtils]: 18: Hoare triple {2631#true} assume !!(~len > 0); {2631#true} is VALID [2020-07-11 01:10:28,561 INFO L280 TraceCheckUtils]: 19: Hoare triple {2631#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {2663#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-11 01:10:28,564 INFO L280 TraceCheckUtils]: 20: Hoare triple {2663#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:28,566 INFO L280 TraceCheckUtils]: 21: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:28,569 INFO L280 TraceCheckUtils]: 22: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:28,574 INFO L280 TraceCheckUtils]: 23: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,575 INFO L280 TraceCheckUtils]: 24: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,575 INFO L280 TraceCheckUtils]: 25: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,576 INFO L280 TraceCheckUtils]: 26: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,577 INFO L280 TraceCheckUtils]: 27: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:28,577 INFO L280 TraceCheckUtils]: 28: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-11 01:10:28,578 INFO L280 TraceCheckUtils]: 29: Hoare triple {2666#(not (= 0 |sll_create_#res.base|))} assume true; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-11 01:10:28,579 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2666#(not (= 0 |sll_create_#res.base|))} {2631#true} #141#return; {2653#(not (= 0 |main_#t~ret10.base|))} is VALID [2020-07-11 01:10:28,580 INFO L280 TraceCheckUtils]: 31: Hoare triple {2653#(not (= 0 |main_#t~ret10.base|))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {2654#(not (= 0 main_~s~0.base))} is VALID [2020-07-11 01:10:28,581 INFO L280 TraceCheckUtils]: 32: Hoare triple {2654#(not (= 0 main_~s~0.base))} havoc #t~ret10.base, #t~ret10.offset; {2654#(not (= 0 main_~s~0.base))} is VALID [2020-07-11 01:10:28,581 INFO L263 TraceCheckUtils]: 33: Hoare triple {2654#(not (= 0 main_~s~0.base))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {2631#true} is VALID [2020-07-11 01:10:28,582 INFO L280 TraceCheckUtils]: 34: Hoare triple {2631#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-11 01:10:28,583 INFO L280 TraceCheckUtils]: 35: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} ~len~0 := 0; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-11 01:10:28,584 INFO L280 TraceCheckUtils]: 36: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-11 01:10:28,585 INFO L280 TraceCheckUtils]: 37: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-11 01:10:28,585 INFO L280 TraceCheckUtils]: 38: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} assume true; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-11 01:10:28,587 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2668#(= 0 |sll_length_#in~head.base|)} {2654#(not (= 0 main_~s~0.base))} #143#return; {2632#false} is VALID [2020-07-11 01:10:28,587 INFO L280 TraceCheckUtils]: 40: Hoare triple {2632#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {2632#false} is VALID [2020-07-11 01:10:28,587 INFO L280 TraceCheckUtils]: 41: Hoare triple {2632#false} assume ~len~1 != #t~ret11; {2632#false} is VALID [2020-07-11 01:10:28,588 INFO L280 TraceCheckUtils]: 42: Hoare triple {2632#false} havoc #t~ret11; {2632#false} is VALID [2020-07-11 01:10:28,588 INFO L280 TraceCheckUtils]: 43: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2020-07-11 01:10:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:10:28,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611468269] [2020-07-11 01:10:28,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:28,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-11 01:10:28,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920118391] [2020-07-11 01:10:28,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-11 01:10:28,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:28,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 01:10:28,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:28,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 01:10:28,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:28,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 01:10:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:10:28,651 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 12 states. [2020-07-11 01:10:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:30,479 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-07-11 01:10:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 01:10:30,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-11 01:10:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 01:10:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-11 01:10:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 01:10:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-11 01:10:30,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 91 transitions. [2020-07-11 01:10:30,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:30,619 INFO L225 Difference]: With dead ends: 101 [2020-07-11 01:10:30,619 INFO L226 Difference]: Without dead ends: 96 [2020-07-11 01:10:30,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-07-11 01:10:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-11 01:10:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2020-07-11 01:10:30,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:30,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 81 states. [2020-07-11 01:10:30,839 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 81 states. [2020-07-11 01:10:30,840 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 81 states. [2020-07-11 01:10:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:30,845 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-11 01:10:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-11 01:10:30,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:30,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:30,846 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 96 states. [2020-07-11 01:10:30,846 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 96 states. [2020-07-11 01:10:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:30,850 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-11 01:10:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-11 01:10:30,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:30,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:30,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:30,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-11 01:10:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-11 01:10:30,855 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 44 [2020-07-11 01:10:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:30,856 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-11 01:10:30,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 01:10:30,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-11 01:10:31,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 01:10:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-11 01:10:31,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:31,011 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:31,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:10:31,011 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash -829611268, now seen corresponding path program 1 times [2020-07-11 01:10:31,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:31,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782989747] [2020-07-11 01:10:31,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:31,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {3265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3243#true} is VALID [2020-07-11 01:10:31,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {3243#true} #valid := #valid[0 := 0]; {3243#true} is VALID [2020-07-11 01:10:31,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} assume 0 < #StackHeapBarrier; {3243#true} is VALID [2020-07-11 01:10:31,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-11 01:10:31,121 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3243#true} {3243#true} #147#return; {3243#true} is VALID [2020-07-11 01:10:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:31,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {3266#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:31,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:31,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:31,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {3268#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:31,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {3268#(<= |sll_create_#in~len| 0)} assume true; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:31,228 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3268#(<= |sll_create_#in~len| 0)} {3252#(<= 3 main_~len~1)} #141#return; {3244#false} is VALID [2020-07-11 01:10:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:31,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {3243#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3243#true} is VALID [2020-07-11 01:10:31,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {3243#true} ~len~0 := 0; {3243#true} is VALID [2020-07-11 01:10:31,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} assume !(~head.base != 0 || ~head.offset != 0); {3243#true} is VALID [2020-07-11 01:10:31,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} #res := ~len~0; {3243#true} is VALID [2020-07-11 01:10:31,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-11 01:10:31,240 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3243#true} {3244#false} #143#return; {3244#false} is VALID [2020-07-11 01:10:31,241 INFO L263 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:31,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {3265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3243#true} is VALID [2020-07-11 01:10:31,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} #valid := #valid[0 := 0]; {3243#true} is VALID [2020-07-11 01:10:31,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} assume 0 < #StackHeapBarrier; {3243#true} is VALID [2020-07-11 01:10:31,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-11 01:10:31,242 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3243#true} {3243#true} #147#return; {3243#true} is VALID [2020-07-11 01:10:31,243 INFO L263 TraceCheckUtils]: 6: Hoare triple {3243#true} call #t~ret12 := main(); {3243#true} is VALID [2020-07-11 01:10:31,243 INFO L280 TraceCheckUtils]: 7: Hoare triple {3243#true} ~len~1 := 2; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,244 INFO L280 TraceCheckUtils]: 8: Hoare triple {3250#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,244 INFO L280 TraceCheckUtils]: 9: Hoare triple {3250#(<= 2 main_~len~1)} assume #t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,245 INFO L280 TraceCheckUtils]: 10: Hoare triple {3250#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,246 INFO L280 TraceCheckUtils]: 11: Hoare triple {3250#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,247 INFO L280 TraceCheckUtils]: 12: Hoare triple {3250#(<= 2 main_~len~1)} assume !!#t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,247 INFO L280 TraceCheckUtils]: 13: Hoare triple {3250#(<= 2 main_~len~1)} havoc #t~nondet7; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,248 INFO L280 TraceCheckUtils]: 14: Hoare triple {3250#(<= 2 main_~len~1)} havoc #t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:31,249 INFO L280 TraceCheckUtils]: 15: Hoare triple {3250#(<= 2 main_~len~1)} #t~post9 := ~len~1; {3251#(<= 2 |main_#t~post9|)} is VALID [2020-07-11 01:10:31,249 INFO L280 TraceCheckUtils]: 16: Hoare triple {3251#(<= 2 |main_#t~post9|)} ~len~1 := 1 + #t~post9; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,250 INFO L280 TraceCheckUtils]: 17: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~post9; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,251 INFO L280 TraceCheckUtils]: 18: Hoare triple {3252#(<= 3 main_~len~1)} #t~short8 := ~len~1 < 32; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,251 INFO L280 TraceCheckUtils]: 19: Hoare triple {3252#(<= 3 main_~len~1)} assume #t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,254 INFO L280 TraceCheckUtils]: 20: Hoare triple {3252#(<= 3 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,260 INFO L280 TraceCheckUtils]: 21: Hoare triple {3252#(<= 3 main_~len~1)} #t~short8 := 0 != #t~nondet7; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,261 INFO L280 TraceCheckUtils]: 22: Hoare triple {3252#(<= 3 main_~len~1)} assume !#t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,264 INFO L280 TraceCheckUtils]: 23: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~nondet7; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,265 INFO L280 TraceCheckUtils]: 24: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:31,266 INFO L263 TraceCheckUtils]: 25: Hoare triple {3252#(<= 3 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {3266#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:31,267 INFO L280 TraceCheckUtils]: 26: Hoare triple {3266#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:31,268 INFO L280 TraceCheckUtils]: 27: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:31,268 INFO L280 TraceCheckUtils]: 28: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:31,269 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:31,270 INFO L280 TraceCheckUtils]: 30: Hoare triple {3268#(<= |sll_create_#in~len| 0)} assume true; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-11 01:10:31,271 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3268#(<= |sll_create_#in~len| 0)} {3252#(<= 3 main_~len~1)} #141#return; {3244#false} is VALID [2020-07-11 01:10:31,271 INFO L280 TraceCheckUtils]: 32: Hoare triple {3244#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {3244#false} is VALID [2020-07-11 01:10:31,272 INFO L280 TraceCheckUtils]: 33: Hoare triple {3244#false} havoc #t~ret10.base, #t~ret10.offset; {3244#false} is VALID [2020-07-11 01:10:31,272 INFO L263 TraceCheckUtils]: 34: Hoare triple {3244#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {3243#true} is VALID [2020-07-11 01:10:31,272 INFO L280 TraceCheckUtils]: 35: Hoare triple {3243#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3243#true} is VALID [2020-07-11 01:10:31,272 INFO L280 TraceCheckUtils]: 36: Hoare triple {3243#true} ~len~0 := 0; {3243#true} is VALID [2020-07-11 01:10:31,273 INFO L280 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !(~head.base != 0 || ~head.offset != 0); {3243#true} is VALID [2020-07-11 01:10:31,273 INFO L280 TraceCheckUtils]: 38: Hoare triple {3243#true} #res := ~len~0; {3243#true} is VALID [2020-07-11 01:10:31,273 INFO L280 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-11 01:10:31,274 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3243#true} {3244#false} #143#return; {3244#false} is VALID [2020-07-11 01:10:31,274 INFO L280 TraceCheckUtils]: 41: Hoare triple {3244#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {3244#false} is VALID [2020-07-11 01:10:31,274 INFO L280 TraceCheckUtils]: 42: Hoare triple {3244#false} assume ~len~1 != #t~ret11; {3244#false} is VALID [2020-07-11 01:10:31,274 INFO L280 TraceCheckUtils]: 43: Hoare triple {3244#false} havoc #t~ret11; {3244#false} is VALID [2020-07-11 01:10:31,275 INFO L280 TraceCheckUtils]: 44: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2020-07-11 01:10:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:10:31,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782989747] [2020-07-11 01:10:31,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:31,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 01:10:31,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196329465] [2020-07-11 01:10:31,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-11 01:10:31,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:31,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 01:10:31,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:31,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 01:10:31,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 01:10:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 01:10:31,354 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2020-07-11 01:10:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:32,603 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2020-07-11 01:10:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 01:10:32,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-11 01:10:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 01:10:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-11 01:10:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 01:10:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-11 01:10:32,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2020-07-11 01:10:32,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:32,809 INFO L225 Difference]: With dead ends: 117 [2020-07-11 01:10:32,810 INFO L226 Difference]: Without dead ends: 87 [2020-07-11 01:10:32,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:10:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-11 01:10:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2020-07-11 01:10:33,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:33,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 69 states. [2020-07-11 01:10:33,009 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 69 states. [2020-07-11 01:10:33,010 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 69 states. [2020-07-11 01:10:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:33,014 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-07-11 01:10:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2020-07-11 01:10:33,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:33,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:33,016 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 87 states. [2020-07-11 01:10:33,016 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 87 states. [2020-07-11 01:10:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:33,021 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-07-11 01:10:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2020-07-11 01:10:33,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:33,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:33,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:33,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-11 01:10:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-07-11 01:10:33,028 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 45 [2020-07-11 01:10:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:33,029 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-07-11 01:10:33,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 01:10:33,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2020-07-11 01:10:33,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-11 01:10:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-11 01:10:33,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:33,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:33,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:10:33,162 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -642872939, now seen corresponding path program 1 times [2020-07-11 01:10:33,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:33,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607348009] [2020-07-11 01:10:33,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:33,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {3868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3832#true} is VALID [2020-07-11 01:10:33,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {3832#true} #valid := #valid[0 := 0]; {3832#true} is VALID [2020-07-11 01:10:33,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {3832#true} assume 0 < #StackHeapBarrier; {3832#true} is VALID [2020-07-11 01:10:33,235 INFO L280 TraceCheckUtils]: 3: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-11 01:10:33,235 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3832#true} {3832#true} #147#return; {3832#true} is VALID [2020-07-11 01:10:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:33,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {3869#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,335 INFO L280 TraceCheckUtils]: 2: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,336 INFO L280 TraceCheckUtils]: 3: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,339 INFO L280 TraceCheckUtils]: 7: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:33,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:33,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:33,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:33,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {3873#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:33,345 INFO L280 TraceCheckUtils]: 13: Hoare triple {3873#(<= |sll_create_#in~len| 1)} assume true; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:33,346 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {3873#(<= |sll_create_#in~len| 1)} {3839#(<= 2 main_~len~1)} #141#return; {3833#false} is VALID [2020-07-11 01:10:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:33,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {3832#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3832#true} is VALID [2020-07-11 01:10:33,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {3832#true} ~len~0 := 0; {3832#true} is VALID [2020-07-11 01:10:33,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {3832#true} assume !!(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-11 01:10:33,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {3832#true} #t~post4 := ~len~0; {3832#true} is VALID [2020-07-11 01:10:33,362 INFO L280 TraceCheckUtils]: 4: Hoare triple {3832#true} ~len~0 := 1 + #t~post4; {3832#true} is VALID [2020-07-11 01:10:33,362 INFO L280 TraceCheckUtils]: 5: Hoare triple {3832#true} havoc #t~post4; {3832#true} is VALID [2020-07-11 01:10:33,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {3832#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {3832#true} is VALID [2020-07-11 01:10:33,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {3832#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-11 01:10:33,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {3832#true} havoc #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-11 01:10:33,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {3832#true} assume !(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-11 01:10:33,363 INFO L280 TraceCheckUtils]: 10: Hoare triple {3832#true} #res := ~len~0; {3832#true} is VALID [2020-07-11 01:10:33,363 INFO L280 TraceCheckUtils]: 11: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-11 01:10:33,364 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3832#true} {3833#false} #143#return; {3833#false} is VALID [2020-07-11 01:10:33,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {3832#true} call ULTIMATE.init(); {3868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:33,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3832#true} is VALID [2020-07-11 01:10:33,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {3832#true} #valid := #valid[0 := 0]; {3832#true} is VALID [2020-07-11 01:10:33,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {3832#true} assume 0 < #StackHeapBarrier; {3832#true} is VALID [2020-07-11 01:10:33,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-11 01:10:33,367 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3832#true} {3832#true} #147#return; {3832#true} is VALID [2020-07-11 01:10:33,367 INFO L263 TraceCheckUtils]: 6: Hoare triple {3832#true} call #t~ret12 := main(); {3832#true} is VALID [2020-07-11 01:10:33,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {3832#true} ~len~1 := 2; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {3839#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {3839#(<= 2 main_~len~1)} assume #t~short8; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,374 INFO L280 TraceCheckUtils]: 10: Hoare triple {3839#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {3839#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {3839#(<= 2 main_~len~1)} assume !#t~short8; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {3839#(<= 2 main_~len~1)} havoc #t~nondet7; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {3839#(<= 2 main_~len~1)} havoc #t~short8; {3839#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:33,387 INFO L263 TraceCheckUtils]: 15: Hoare triple {3839#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {3869#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:33,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {3869#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,389 INFO L280 TraceCheckUtils]: 17: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,389 INFO L280 TraceCheckUtils]: 18: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,391 INFO L280 TraceCheckUtils]: 20: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,392 INFO L280 TraceCheckUtils]: 22: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,393 INFO L280 TraceCheckUtils]: 23: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:33,394 INFO L280 TraceCheckUtils]: 24: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:33,395 INFO L280 TraceCheckUtils]: 25: Hoare triple {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:33,396 INFO L280 TraceCheckUtils]: 26: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:33,397 INFO L280 TraceCheckUtils]: 27: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:33,398 INFO L280 TraceCheckUtils]: 28: Hoare triple {3873#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:33,399 INFO L280 TraceCheckUtils]: 29: Hoare triple {3873#(<= |sll_create_#in~len| 1)} assume true; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:33,400 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3873#(<= |sll_create_#in~len| 1)} {3839#(<= 2 main_~len~1)} #141#return; {3833#false} is VALID [2020-07-11 01:10:33,401 INFO L280 TraceCheckUtils]: 31: Hoare triple {3833#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {3833#false} is VALID [2020-07-11 01:10:33,401 INFO L280 TraceCheckUtils]: 32: Hoare triple {3833#false} havoc #t~ret10.base, #t~ret10.offset; {3833#false} is VALID [2020-07-11 01:10:33,401 INFO L263 TraceCheckUtils]: 33: Hoare triple {3833#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {3832#true} is VALID [2020-07-11 01:10:33,402 INFO L280 TraceCheckUtils]: 34: Hoare triple {3832#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3832#true} is VALID [2020-07-11 01:10:33,402 INFO L280 TraceCheckUtils]: 35: Hoare triple {3832#true} ~len~0 := 0; {3832#true} is VALID [2020-07-11 01:10:33,402 INFO L280 TraceCheckUtils]: 36: Hoare triple {3832#true} assume !!(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-11 01:10:33,402 INFO L280 TraceCheckUtils]: 37: Hoare triple {3832#true} #t~post4 := ~len~0; {3832#true} is VALID [2020-07-11 01:10:33,403 INFO L280 TraceCheckUtils]: 38: Hoare triple {3832#true} ~len~0 := 1 + #t~post4; {3832#true} is VALID [2020-07-11 01:10:33,403 INFO L280 TraceCheckUtils]: 39: Hoare triple {3832#true} havoc #t~post4; {3832#true} is VALID [2020-07-11 01:10:33,403 INFO L280 TraceCheckUtils]: 40: Hoare triple {3832#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {3832#true} is VALID [2020-07-11 01:10:33,403 INFO L280 TraceCheckUtils]: 41: Hoare triple {3832#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-11 01:10:33,404 INFO L280 TraceCheckUtils]: 42: Hoare triple {3832#true} havoc #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-11 01:10:33,404 INFO L280 TraceCheckUtils]: 43: Hoare triple {3832#true} assume !(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-11 01:10:33,404 INFO L280 TraceCheckUtils]: 44: Hoare triple {3832#true} #res := ~len~0; {3832#true} is VALID [2020-07-11 01:10:33,405 INFO L280 TraceCheckUtils]: 45: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-11 01:10:33,405 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3832#true} {3833#false} #143#return; {3833#false} is VALID [2020-07-11 01:10:33,405 INFO L280 TraceCheckUtils]: 47: Hoare triple {3833#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {3833#false} is VALID [2020-07-11 01:10:33,405 INFO L280 TraceCheckUtils]: 48: Hoare triple {3833#false} assume ~len~1 != #t~ret11; {3833#false} is VALID [2020-07-11 01:10:33,406 INFO L280 TraceCheckUtils]: 49: Hoare triple {3833#false} havoc #t~ret11; {3833#false} is VALID [2020-07-11 01:10:33,406 INFO L280 TraceCheckUtils]: 50: Hoare triple {3833#false} assume !false; {3833#false} is VALID [2020-07-11 01:10:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 01:10:33,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607348009] [2020-07-11 01:10:33,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:33,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 01:10:33,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267422973] [2020-07-11 01:10:33,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-11 01:10:33,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:33,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 01:10:33,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:33,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 01:10:33,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 01:10:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 01:10:33,475 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 9 states. [2020-07-11 01:10:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:34,597 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-11 01:10:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 01:10:34,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-11 01:10:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 01:10:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2020-07-11 01:10:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 01:10:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2020-07-11 01:10:34,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2020-07-11 01:10:34,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:34,763 INFO L225 Difference]: With dead ends: 120 [2020-07-11 01:10:34,764 INFO L226 Difference]: Without dead ends: 99 [2020-07-11 01:10:34,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-07-11 01:10:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-11 01:10:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2020-07-11 01:10:34,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:34,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 84 states. [2020-07-11 01:10:34,967 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 84 states. [2020-07-11 01:10:34,968 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 84 states. [2020-07-11 01:10:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:34,972 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-11 01:10:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2020-07-11 01:10:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:34,973 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 99 states. [2020-07-11 01:10:34,973 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 99 states. [2020-07-11 01:10:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:34,977 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-11 01:10:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2020-07-11 01:10:34,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:34,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:34,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:34,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-11 01:10:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2020-07-11 01:10:34,981 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 51 [2020-07-11 01:10:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:34,982 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2020-07-11 01:10:34,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 01:10:34,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 90 transitions. [2020-07-11 01:10:35,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2020-07-11 01:10:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-11 01:10:35,149 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:35,149 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:35,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:10:35,150 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1372689452, now seen corresponding path program 2 times [2020-07-11 01:10:35,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:35,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726647251] [2020-07-11 01:10:35,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:35,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {4540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4495#true} is VALID [2020-07-11 01:10:35,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {4495#true} #valid := #valid[0 := 0]; {4495#true} is VALID [2020-07-11 01:10:35,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {4495#true} assume 0 < #StackHeapBarrier; {4495#true} is VALID [2020-07-11 01:10:35,224 INFO L280 TraceCheckUtils]: 3: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-11 01:10:35,224 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4495#true} {4495#true} #147#return; {4495#true} is VALID [2020-07-11 01:10:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:35,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {4541#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,378 INFO L280 TraceCheckUtils]: 3: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,379 INFO L280 TraceCheckUtils]: 5: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,379 INFO L280 TraceCheckUtils]: 6: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,380 INFO L280 TraceCheckUtils]: 7: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:35,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,387 INFO L280 TraceCheckUtils]: 16: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-11 01:10:35,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:35,389 INFO L280 TraceCheckUtils]: 19: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:35,390 INFO L280 TraceCheckUtils]: 20: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:35,390 INFO L280 TraceCheckUtils]: 21: Hoare triple {4547#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:35,391 INFO L280 TraceCheckUtils]: 22: Hoare triple {4547#(<= |sll_create_#in~len| 2)} assume true; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:35,393 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4547#(<= |sll_create_#in~len| 2)} {4502#(<= 2 main_~len~1)} #141#return; {4496#false} is VALID [2020-07-11 01:10:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:35,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {4495#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {4495#true} is VALID [2020-07-11 01:10:35,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {4495#true} ~len~0 := 0; {4495#true} is VALID [2020-07-11 01:10:35,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {4495#true} assume !!(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-11 01:10:35,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {4495#true} #t~post4 := ~len~0; {4495#true} is VALID [2020-07-11 01:10:35,402 INFO L280 TraceCheckUtils]: 4: Hoare triple {4495#true} ~len~0 := 1 + #t~post4; {4495#true} is VALID [2020-07-11 01:10:35,403 INFO L280 TraceCheckUtils]: 5: Hoare triple {4495#true} havoc #t~post4; {4495#true} is VALID [2020-07-11 01:10:35,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {4495#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {4495#true} is VALID [2020-07-11 01:10:35,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {4495#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-11 01:10:35,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {4495#true} havoc #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-11 01:10:35,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {4495#true} assume !(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-11 01:10:35,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {4495#true} #res := ~len~0; {4495#true} is VALID [2020-07-11 01:10:35,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-11 01:10:35,404 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4495#true} {4496#false} #143#return; {4496#false} is VALID [2020-07-11 01:10:35,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {4495#true} call ULTIMATE.init(); {4540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:35,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {4540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4495#true} is VALID [2020-07-11 01:10:35,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {4495#true} #valid := #valid[0 := 0]; {4495#true} is VALID [2020-07-11 01:10:35,406 INFO L280 TraceCheckUtils]: 3: Hoare triple {4495#true} assume 0 < #StackHeapBarrier; {4495#true} is VALID [2020-07-11 01:10:35,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-11 01:10:35,407 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4495#true} {4495#true} #147#return; {4495#true} is VALID [2020-07-11 01:10:35,407 INFO L263 TraceCheckUtils]: 6: Hoare triple {4495#true} call #t~ret12 := main(); {4495#true} is VALID [2020-07-11 01:10:35,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {4495#true} ~len~1 := 2; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {4502#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {4502#(<= 2 main_~len~1)} assume #t~short8; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,409 INFO L280 TraceCheckUtils]: 10: Hoare triple {4502#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {4502#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,411 INFO L280 TraceCheckUtils]: 12: Hoare triple {4502#(<= 2 main_~len~1)} assume !#t~short8; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,411 INFO L280 TraceCheckUtils]: 13: Hoare triple {4502#(<= 2 main_~len~1)} havoc #t~nondet7; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {4502#(<= 2 main_~len~1)} havoc #t~short8; {4502#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:35,413 INFO L263 TraceCheckUtils]: 15: Hoare triple {4502#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {4541#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:35,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {4541#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,418 INFO L280 TraceCheckUtils]: 23: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:35,419 INFO L280 TraceCheckUtils]: 24: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:35,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,420 INFO L280 TraceCheckUtils]: 26: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,421 INFO L280 TraceCheckUtils]: 27: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,421 INFO L280 TraceCheckUtils]: 28: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,422 INFO L280 TraceCheckUtils]: 29: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,423 INFO L280 TraceCheckUtils]: 30: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,423 INFO L280 TraceCheckUtils]: 31: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:35,425 INFO L280 TraceCheckUtils]: 33: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-11 01:10:35,426 INFO L280 TraceCheckUtils]: 34: Hoare triple {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:35,426 INFO L280 TraceCheckUtils]: 35: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:35,427 INFO L280 TraceCheckUtils]: 36: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:35,428 INFO L280 TraceCheckUtils]: 37: Hoare triple {4547#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:35,428 INFO L280 TraceCheckUtils]: 38: Hoare triple {4547#(<= |sll_create_#in~len| 2)} assume true; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:35,430 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4547#(<= |sll_create_#in~len| 2)} {4502#(<= 2 main_~len~1)} #141#return; {4496#false} is VALID [2020-07-11 01:10:35,430 INFO L280 TraceCheckUtils]: 40: Hoare triple {4496#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {4496#false} is VALID [2020-07-11 01:10:35,430 INFO L280 TraceCheckUtils]: 41: Hoare triple {4496#false} havoc #t~ret10.base, #t~ret10.offset; {4496#false} is VALID [2020-07-11 01:10:35,431 INFO L263 TraceCheckUtils]: 42: Hoare triple {4496#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {4495#true} is VALID [2020-07-11 01:10:35,431 INFO L280 TraceCheckUtils]: 43: Hoare triple {4495#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {4495#true} is VALID [2020-07-11 01:10:35,431 INFO L280 TraceCheckUtils]: 44: Hoare triple {4495#true} ~len~0 := 0; {4495#true} is VALID [2020-07-11 01:10:35,432 INFO L280 TraceCheckUtils]: 45: Hoare triple {4495#true} assume !!(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-11 01:10:35,432 INFO L280 TraceCheckUtils]: 46: Hoare triple {4495#true} #t~post4 := ~len~0; {4495#true} is VALID [2020-07-11 01:10:35,432 INFO L280 TraceCheckUtils]: 47: Hoare triple {4495#true} ~len~0 := 1 + #t~post4; {4495#true} is VALID [2020-07-11 01:10:35,432 INFO L280 TraceCheckUtils]: 48: Hoare triple {4495#true} havoc #t~post4; {4495#true} is VALID [2020-07-11 01:10:35,432 INFO L280 TraceCheckUtils]: 49: Hoare triple {4495#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {4495#true} is VALID [2020-07-11 01:10:35,432 INFO L280 TraceCheckUtils]: 50: Hoare triple {4495#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-11 01:10:35,433 INFO L280 TraceCheckUtils]: 51: Hoare triple {4495#true} havoc #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-11 01:10:35,433 INFO L280 TraceCheckUtils]: 52: Hoare triple {4495#true} assume !(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-11 01:10:35,433 INFO L280 TraceCheckUtils]: 53: Hoare triple {4495#true} #res := ~len~0; {4495#true} is VALID [2020-07-11 01:10:35,433 INFO L280 TraceCheckUtils]: 54: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-11 01:10:35,433 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {4495#true} {4496#false} #143#return; {4496#false} is VALID [2020-07-11 01:10:35,434 INFO L280 TraceCheckUtils]: 56: Hoare triple {4496#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {4496#false} is VALID [2020-07-11 01:10:35,434 INFO L280 TraceCheckUtils]: 57: Hoare triple {4496#false} assume ~len~1 != #t~ret11; {4496#false} is VALID [2020-07-11 01:10:35,434 INFO L280 TraceCheckUtils]: 58: Hoare triple {4496#false} havoc #t~ret11; {4496#false} is VALID [2020-07-11 01:10:35,434 INFO L280 TraceCheckUtils]: 59: Hoare triple {4496#false} assume !false; {4496#false} is VALID [2020-07-11 01:10:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 01:10:35,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726647251] [2020-07-11 01:10:35,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:35,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 01:10:35,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601804949] [2020-07-11 01:10:35,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-11 01:10:35,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:35,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 01:10:35,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:35,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 01:10:35,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:35,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 01:10:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:10:35,501 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 11 states. [2020-07-11 01:10:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:36,925 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2020-07-11 01:10:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 01:10:36,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-11 01:10:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:10:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-11 01:10:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:10:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-11 01:10:36,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 135 transitions. [2020-07-11 01:10:37,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:37,093 INFO L225 Difference]: With dead ends: 132 [2020-07-11 01:10:37,093 INFO L226 Difference]: Without dead ends: 111 [2020-07-11 01:10:37,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-07-11 01:10:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-11 01:10:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2020-07-11 01:10:37,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:37,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 93 states. [2020-07-11 01:10:37,361 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 93 states. [2020-07-11 01:10:37,361 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 93 states. [2020-07-11 01:10:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:37,368 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2020-07-11 01:10:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2020-07-11 01:10:37,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:37,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:37,369 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 111 states. [2020-07-11 01:10:37,370 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 111 states. [2020-07-11 01:10:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:37,380 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2020-07-11 01:10:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2020-07-11 01:10:37,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:37,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:37,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:37,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-11 01:10:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2020-07-11 01:10:37,385 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 60 [2020-07-11 01:10:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:37,385 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2020-07-11 01:10:37,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 01:10:37,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 100 transitions. [2020-07-11 01:10:37,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2020-07-11 01:10:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 01:10:37,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:37,574 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:37,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:10:37,574 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1521110738, now seen corresponding path program 1 times [2020-07-11 01:10:37,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:37,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [571537996] [2020-07-11 01:10:37,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:37,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {5279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5241#true} is VALID [2020-07-11 01:10:37,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {5241#true} #valid := #valid[0 := 0]; {5241#true} is VALID [2020-07-11 01:10:37,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {5241#true} assume 0 < #StackHeapBarrier; {5241#true} is VALID [2020-07-11 01:10:37,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-11 01:10:37,648 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5241#true} {5241#true} #147#return; {5241#true} is VALID [2020-07-11 01:10:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:37,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {5280#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,753 INFO L280 TraceCheckUtils]: 3: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,754 INFO L280 TraceCheckUtils]: 5: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,754 INFO L280 TraceCheckUtils]: 6: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,754 INFO L280 TraceCheckUtils]: 7: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,755 INFO L280 TraceCheckUtils]: 8: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:37,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:37,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:37,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:37,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {5284#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:37,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {5284#(<= |sll_create_#in~len| 1)} assume true; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:37,758 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {5284#(<= |sll_create_#in~len| 1)} {5250#(<= 3 main_~len~1)} #141#return; {5242#false} is VALID [2020-07-11 01:10:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:37,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {5241#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {5241#true} is VALID [2020-07-11 01:10:37,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {5241#true} ~len~0 := 0; {5241#true} is VALID [2020-07-11 01:10:37,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {5241#true} assume !!(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-11 01:10:37,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {5241#true} #t~post4 := ~len~0; {5241#true} is VALID [2020-07-11 01:10:37,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {5241#true} ~len~0 := 1 + #t~post4; {5241#true} is VALID [2020-07-11 01:10:37,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {5241#true} havoc #t~post4; {5241#true} is VALID [2020-07-11 01:10:37,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {5241#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {5241#true} is VALID [2020-07-11 01:10:37,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {5241#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-11 01:10:37,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {5241#true} havoc #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-11 01:10:37,773 INFO L280 TraceCheckUtils]: 9: Hoare triple {5241#true} assume !(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-11 01:10:37,773 INFO L280 TraceCheckUtils]: 10: Hoare triple {5241#true} #res := ~len~0; {5241#true} is VALID [2020-07-11 01:10:37,773 INFO L280 TraceCheckUtils]: 11: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-11 01:10:37,774 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5241#true} {5242#false} #143#return; {5242#false} is VALID [2020-07-11 01:10:37,775 INFO L263 TraceCheckUtils]: 0: Hoare triple {5241#true} call ULTIMATE.init(); {5279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:37,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {5279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5241#true} is VALID [2020-07-11 01:10:37,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {5241#true} #valid := #valid[0 := 0]; {5241#true} is VALID [2020-07-11 01:10:37,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {5241#true} assume 0 < #StackHeapBarrier; {5241#true} is VALID [2020-07-11 01:10:37,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-11 01:10:37,776 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5241#true} {5241#true} #147#return; {5241#true} is VALID [2020-07-11 01:10:37,776 INFO L263 TraceCheckUtils]: 6: Hoare triple {5241#true} call #t~ret12 := main(); {5241#true} is VALID [2020-07-11 01:10:37,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {5241#true} ~len~1 := 2; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,777 INFO L280 TraceCheckUtils]: 8: Hoare triple {5248#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {5248#(<= 2 main_~len~1)} assume #t~short8; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {5248#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,778 INFO L280 TraceCheckUtils]: 11: Hoare triple {5248#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {5248#(<= 2 main_~len~1)} assume !!#t~short8; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,780 INFO L280 TraceCheckUtils]: 13: Hoare triple {5248#(<= 2 main_~len~1)} havoc #t~nondet7; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {5248#(<= 2 main_~len~1)} havoc #t~short8; {5248#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:37,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {5248#(<= 2 main_~len~1)} #t~post9 := ~len~1; {5249#(<= 2 |main_#t~post9|)} is VALID [2020-07-11 01:10:37,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {5249#(<= 2 |main_#t~post9|)} ~len~1 := 1 + #t~post9; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {5250#(<= 3 main_~len~1)} havoc #t~post9; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {5250#(<= 3 main_~len~1)} #t~short8 := ~len~1 < 32; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,783 INFO L280 TraceCheckUtils]: 19: Hoare triple {5250#(<= 3 main_~len~1)} assume #t~short8; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,784 INFO L280 TraceCheckUtils]: 20: Hoare triple {5250#(<= 3 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,784 INFO L280 TraceCheckUtils]: 21: Hoare triple {5250#(<= 3 main_~len~1)} #t~short8 := 0 != #t~nondet7; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,785 INFO L280 TraceCheckUtils]: 22: Hoare triple {5250#(<= 3 main_~len~1)} assume !#t~short8; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,785 INFO L280 TraceCheckUtils]: 23: Hoare triple {5250#(<= 3 main_~len~1)} havoc #t~nondet7; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,786 INFO L280 TraceCheckUtils]: 24: Hoare triple {5250#(<= 3 main_~len~1)} havoc #t~short8; {5250#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:37,787 INFO L263 TraceCheckUtils]: 25: Hoare triple {5250#(<= 3 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {5280#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:37,787 INFO L280 TraceCheckUtils]: 26: Hoare triple {5280#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,788 INFO L280 TraceCheckUtils]: 27: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,788 INFO L280 TraceCheckUtils]: 28: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,789 INFO L280 TraceCheckUtils]: 29: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,789 INFO L280 TraceCheckUtils]: 30: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,790 INFO L280 TraceCheckUtils]: 31: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,790 INFO L280 TraceCheckUtils]: 32: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,791 INFO L280 TraceCheckUtils]: 33: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:37,791 INFO L280 TraceCheckUtils]: 34: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:37,792 INFO L280 TraceCheckUtils]: 35: Hoare triple {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:37,793 INFO L280 TraceCheckUtils]: 36: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:37,793 INFO L280 TraceCheckUtils]: 37: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:37,794 INFO L280 TraceCheckUtils]: 38: Hoare triple {5284#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:37,794 INFO L280 TraceCheckUtils]: 39: Hoare triple {5284#(<= |sll_create_#in~len| 1)} assume true; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-11 01:10:37,796 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {5284#(<= |sll_create_#in~len| 1)} {5250#(<= 3 main_~len~1)} #141#return; {5242#false} is VALID [2020-07-11 01:10:37,796 INFO L280 TraceCheckUtils]: 41: Hoare triple {5242#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {5242#false} is VALID [2020-07-11 01:10:37,796 INFO L280 TraceCheckUtils]: 42: Hoare triple {5242#false} havoc #t~ret10.base, #t~ret10.offset; {5242#false} is VALID [2020-07-11 01:10:37,796 INFO L263 TraceCheckUtils]: 43: Hoare triple {5242#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {5241#true} is VALID [2020-07-11 01:10:37,796 INFO L280 TraceCheckUtils]: 44: Hoare triple {5241#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {5241#true} is VALID [2020-07-11 01:10:37,797 INFO L280 TraceCheckUtils]: 45: Hoare triple {5241#true} ~len~0 := 0; {5241#true} is VALID [2020-07-11 01:10:37,797 INFO L280 TraceCheckUtils]: 46: Hoare triple {5241#true} assume !!(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-11 01:10:37,797 INFO L280 TraceCheckUtils]: 47: Hoare triple {5241#true} #t~post4 := ~len~0; {5241#true} is VALID [2020-07-11 01:10:37,797 INFO L280 TraceCheckUtils]: 48: Hoare triple {5241#true} ~len~0 := 1 + #t~post4; {5241#true} is VALID [2020-07-11 01:10:37,797 INFO L280 TraceCheckUtils]: 49: Hoare triple {5241#true} havoc #t~post4; {5241#true} is VALID [2020-07-11 01:10:37,797 INFO L280 TraceCheckUtils]: 50: Hoare triple {5241#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {5241#true} is VALID [2020-07-11 01:10:37,798 INFO L280 TraceCheckUtils]: 51: Hoare triple {5241#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-11 01:10:37,798 INFO L280 TraceCheckUtils]: 52: Hoare triple {5241#true} havoc #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-11 01:10:37,798 INFO L280 TraceCheckUtils]: 53: Hoare triple {5241#true} assume !(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-11 01:10:37,798 INFO L280 TraceCheckUtils]: 54: Hoare triple {5241#true} #res := ~len~0; {5241#true} is VALID [2020-07-11 01:10:37,798 INFO L280 TraceCheckUtils]: 55: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-11 01:10:37,799 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {5241#true} {5242#false} #143#return; {5242#false} is VALID [2020-07-11 01:10:37,799 INFO L280 TraceCheckUtils]: 57: Hoare triple {5242#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {5242#false} is VALID [2020-07-11 01:10:37,799 INFO L280 TraceCheckUtils]: 58: Hoare triple {5242#false} assume ~len~1 != #t~ret11; {5242#false} is VALID [2020-07-11 01:10:37,799 INFO L280 TraceCheckUtils]: 59: Hoare triple {5242#false} havoc #t~ret11; {5242#false} is VALID [2020-07-11 01:10:37,799 INFO L280 TraceCheckUtils]: 60: Hoare triple {5242#false} assume !false; {5242#false} is VALID [2020-07-11 01:10:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 01:10:37,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [571537996] [2020-07-11 01:10:37,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:37,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 01:10:37,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757703913] [2020-07-11 01:10:37,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-07-11 01:10:37,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:37,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 01:10:37,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:37,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 01:10:37,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 01:10:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:10:37,877 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 11 states. [2020-07-11 01:10:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:39,511 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2020-07-11 01:10:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 01:10:39,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-07-11 01:10:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:10:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2020-07-11 01:10:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:10:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2020-07-11 01:10:39,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 121 transitions. [2020-07-11 01:10:39,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:39,679 INFO L225 Difference]: With dead ends: 125 [2020-07-11 01:10:39,679 INFO L226 Difference]: Without dead ends: 101 [2020-07-11 01:10:39,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-07-11 01:10:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-11 01:10:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2020-07-11 01:10:39,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:39,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 93 states. [2020-07-11 01:10:39,931 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 93 states. [2020-07-11 01:10:39,931 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 93 states. [2020-07-11 01:10:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:39,936 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-11 01:10:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-11 01:10:39,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:39,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:39,937 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 101 states. [2020-07-11 01:10:39,937 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 101 states. [2020-07-11 01:10:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:39,941 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-11 01:10:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-11 01:10:39,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:39,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:39,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:39,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-11 01:10:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2020-07-11 01:10:39,945 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 61 [2020-07-11 01:10:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:39,946 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2020-07-11 01:10:39,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 01:10:39,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 99 transitions. [2020-07-11 01:10:40,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2020-07-11 01:10:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-11 01:10:40,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:40,128 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:40,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:10:40,128 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:40,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1187742581, now seen corresponding path program 3 times [2020-07-11 01:10:40,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:40,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605434917] [2020-07-11 01:10:40,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:40,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {5999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5944#true} is VALID [2020-07-11 01:10:40,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {5944#true} #valid := #valid[0 := 0]; {5944#true} is VALID [2020-07-11 01:10:40,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {5944#true} assume 0 < #StackHeapBarrier; {5944#true} is VALID [2020-07-11 01:10:40,219 INFO L280 TraceCheckUtils]: 3: Hoare triple {5944#true} assume true; {5944#true} is VALID [2020-07-11 01:10:40,220 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5944#true} {5944#true} #147#return; {5944#true} is VALID [2020-07-11 01:10:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:40,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {6000#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5944#true} is VALID [2020-07-11 01:10:40,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := 0, 0; {5944#true} is VALID [2020-07-11 01:10:40,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-11 01:10:40,344 INFO L280 TraceCheckUtils]: 3: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5944#true} is VALID [2020-07-11 01:10:40,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {5944#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5944#true} is VALID [2020-07-11 01:10:40,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {5944#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5944#true} is VALID [2020-07-11 01:10:40,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {5944#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5944#true} is VALID [2020-07-11 01:10:40,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5944#true} is VALID [2020-07-11 01:10:40,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {5944#true} #t~post3 := ~len; {5944#true} is VALID [2020-07-11 01:10:40,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {5944#true} ~len := #t~post3 - 1; {5944#true} is VALID [2020-07-11 01:10:40,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {5944#true} havoc #t~post3; {5944#true} is VALID [2020-07-11 01:10:40,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-11 01:10:40,346 INFO L280 TraceCheckUtils]: 12: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6001#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-11 01:10:40,347 INFO L280 TraceCheckUtils]: 13: Hoare triple {6001#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:40,347 INFO L280 TraceCheckUtils]: 14: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:40,348 INFO L280 TraceCheckUtils]: 15: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:40,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,349 INFO L280 TraceCheckUtils]: 17: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,349 INFO L280 TraceCheckUtils]: 19: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,350 INFO L280 TraceCheckUtils]: 20: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,353 INFO L280 TraceCheckUtils]: 21: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,354 INFO L280 TraceCheckUtils]: 23: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,355 INFO L280 TraceCheckUtils]: 24: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} is VALID [2020-07-11 01:10:40,355 INFO L280 TraceCheckUtils]: 25: Hoare triple {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,356 INFO L280 TraceCheckUtils]: 26: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #t~post3 := ~len; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,356 INFO L280 TraceCheckUtils]: 27: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} ~len := #t~post3 - 1; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,357 INFO L280 TraceCheckUtils]: 28: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} havoc #t~post3; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,357 INFO L280 TraceCheckUtils]: 29: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,357 INFO L280 TraceCheckUtils]: 30: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-11 01:10:40,358 INFO L280 TraceCheckUtils]: 31: Hoare triple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-11 01:10:40,359 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {5944#true} #141#return; {5984#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2020-07-11 01:10:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:40,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {5944#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0); {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,474 INFO L280 TraceCheckUtils]: 3: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} #t~post4 := ~len~0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 1 + #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} havoc #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} is VALID [2020-07-11 01:10:40,476 INFO L280 TraceCheckUtils]: 7: Hoare triple {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-11 01:10:40,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} havoc #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-11 01:10:40,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-11 01:10:40,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} #res := ~len~0; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-11 01:10:40,478 INFO L280 TraceCheckUtils]: 11: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} assume true; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-11 01:10:40,479 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #143#return; {5945#false} is VALID [2020-07-11 01:10:40,480 INFO L263 TraceCheckUtils]: 0: Hoare triple {5944#true} call ULTIMATE.init(); {5999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:40,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {5999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5944#true} is VALID [2020-07-11 01:10:40,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {5944#true} #valid := #valid[0 := 0]; {5944#true} is VALID [2020-07-11 01:10:40,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {5944#true} assume 0 < #StackHeapBarrier; {5944#true} is VALID [2020-07-11 01:10:40,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {5944#true} assume true; {5944#true} is VALID [2020-07-11 01:10:40,480 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5944#true} {5944#true} #147#return; {5944#true} is VALID [2020-07-11 01:10:40,480 INFO L263 TraceCheckUtils]: 6: Hoare triple {5944#true} call #t~ret12 := main(); {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {5944#true} ~len~1 := 2; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {5944#true} #t~short8 := ~len~1 < 32; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 9: Hoare triple {5944#true} assume #t~short8; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 10: Hoare triple {5944#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 11: Hoare triple {5944#true} #t~short8 := 0 != #t~nondet7; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 12: Hoare triple {5944#true} assume !#t~short8; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 13: Hoare triple {5944#true} havoc #t~nondet7; {5944#true} is VALID [2020-07-11 01:10:40,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {5944#true} havoc #t~short8; {5944#true} is VALID [2020-07-11 01:10:40,482 INFO L263 TraceCheckUtils]: 15: Hoare triple {5944#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {6000#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:40,482 INFO L280 TraceCheckUtils]: 16: Hoare triple {6000#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 17: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := 0, 0; {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 18: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 19: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 20: Hoare triple {5944#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 21: Hoare triple {5944#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 22: Hoare triple {5944#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 23: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5944#true} is VALID [2020-07-11 01:10:40,483 INFO L280 TraceCheckUtils]: 24: Hoare triple {5944#true} #t~post3 := ~len; {5944#true} is VALID [2020-07-11 01:10:40,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {5944#true} ~len := #t~post3 - 1; {5944#true} is VALID [2020-07-11 01:10:40,484 INFO L280 TraceCheckUtils]: 26: Hoare triple {5944#true} havoc #t~post3; {5944#true} is VALID [2020-07-11 01:10:40,484 INFO L280 TraceCheckUtils]: 27: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-11 01:10:40,484 INFO L280 TraceCheckUtils]: 28: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6001#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-11 01:10:40,485 INFO L280 TraceCheckUtils]: 29: Hoare triple {6001#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:40,485 INFO L280 TraceCheckUtils]: 30: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:40,485 INFO L280 TraceCheckUtils]: 31: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-11 01:10:40,486 INFO L280 TraceCheckUtils]: 32: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,486 INFO L280 TraceCheckUtils]: 33: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,486 INFO L280 TraceCheckUtils]: 34: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,487 INFO L280 TraceCheckUtils]: 35: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,487 INFO L280 TraceCheckUtils]: 36: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,488 INFO L280 TraceCheckUtils]: 37: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,488 INFO L280 TraceCheckUtils]: 38: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,488 INFO L280 TraceCheckUtils]: 39: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-11 01:10:40,489 INFO L280 TraceCheckUtils]: 40: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} is VALID [2020-07-11 01:10:40,489 INFO L280 TraceCheckUtils]: 41: Hoare triple {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,490 INFO L280 TraceCheckUtils]: 42: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #t~post3 := ~len; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,490 INFO L280 TraceCheckUtils]: 43: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} ~len := #t~post3 - 1; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,490 INFO L280 TraceCheckUtils]: 44: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} havoc #t~post3; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,491 INFO L280 TraceCheckUtils]: 45: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-11 01:10:40,491 INFO L280 TraceCheckUtils]: 46: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-11 01:10:40,492 INFO L280 TraceCheckUtils]: 47: Hoare triple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-11 01:10:40,493 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {5944#true} #141#return; {5984#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2020-07-11 01:10:40,493 INFO L280 TraceCheckUtils]: 49: Hoare triple {5984#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2020-07-11 01:10:40,493 INFO L280 TraceCheckUtils]: 50: Hoare triple {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} havoc #t~ret10.base, #t~ret10.offset; {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2020-07-11 01:10:40,494 INFO L263 TraceCheckUtils]: 51: Hoare triple {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {5944#true} is VALID [2020-07-11 01:10:40,494 INFO L280 TraceCheckUtils]: 52: Hoare triple {5944#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,494 INFO L280 TraceCheckUtils]: 53: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,495 INFO L280 TraceCheckUtils]: 54: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0); {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,496 INFO L280 TraceCheckUtils]: 55: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} #t~post4 := ~len~0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,496 INFO L280 TraceCheckUtils]: 56: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 1 + #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,497 INFO L280 TraceCheckUtils]: 57: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} havoc #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-11 01:10:40,497 INFO L280 TraceCheckUtils]: 58: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} is VALID [2020-07-11 01:10:40,498 INFO L280 TraceCheckUtils]: 59: Hoare triple {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-11 01:10:40,498 INFO L280 TraceCheckUtils]: 60: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} havoc #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-11 01:10:40,499 INFO L280 TraceCheckUtils]: 61: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-11 01:10:40,500 INFO L280 TraceCheckUtils]: 62: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} #res := ~len~0; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-11 01:10:40,500 INFO L280 TraceCheckUtils]: 63: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} assume true; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-11 01:10:40,501 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #143#return; {5945#false} is VALID [2020-07-11 01:10:40,501 INFO L280 TraceCheckUtils]: 65: Hoare triple {5945#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {5945#false} is VALID [2020-07-11 01:10:40,501 INFO L280 TraceCheckUtils]: 66: Hoare triple {5945#false} assume ~len~1 != #t~ret11; {5945#false} is VALID [2020-07-11 01:10:40,501 INFO L280 TraceCheckUtils]: 67: Hoare triple {5945#false} havoc #t~ret11; {5945#false} is VALID [2020-07-11 01:10:40,501 INFO L280 TraceCheckUtils]: 68: Hoare triple {5945#false} assume !false; {5945#false} is VALID [2020-07-11 01:10:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 01:10:40,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605434917] [2020-07-11 01:10:40,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:40,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-11 01:10:40,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393946324] [2020-07-11 01:10:40,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-11 01:10:40,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:40,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-11 01:10:40,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:40,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-11 01:10:40,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-11 01:10:40,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:10:40,601 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 16 states. [2020-07-11 01:10:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:43,239 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2020-07-11 01:10:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 01:10:43,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-11 01:10:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 01:10:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2020-07-11 01:10:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 01:10:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2020-07-11 01:10:43,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 94 transitions. [2020-07-11 01:10:43,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:43,425 INFO L225 Difference]: With dead ends: 113 [2020-07-11 01:10:43,425 INFO L226 Difference]: Without dead ends: 105 [2020-07-11 01:10:43,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2020-07-11 01:10:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-11 01:10:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2020-07-11 01:10:43,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:43,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 100 states. [2020-07-11 01:10:43,786 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 100 states. [2020-07-11 01:10:43,786 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 100 states. [2020-07-11 01:10:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:43,789 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2020-07-11 01:10:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2020-07-11 01:10:43,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:43,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:43,790 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 105 states. [2020-07-11 01:10:43,790 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 105 states. [2020-07-11 01:10:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:43,794 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2020-07-11 01:10:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2020-07-11 01:10:43,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:43,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:43,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:43,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-11 01:10:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2020-07-11 01:10:43,798 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 69 [2020-07-11 01:10:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:43,798 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2020-07-11 01:10:43,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-11 01:10:43,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 106 transitions. [2020-07-11 01:10:43,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2020-07-11 01:10:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-11 01:10:43,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:43,996 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:43,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:10:43,996 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 979580858, now seen corresponding path program 4 times [2020-07-11 01:10:43,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:43,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091779617] [2020-07-11 01:10:43,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:44,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {6739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6677#true} is VALID [2020-07-11 01:10:44,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {6677#true} #valid := #valid[0 := 0]; {6677#true} is VALID [2020-07-11 01:10:44,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {6677#true} assume 0 < #StackHeapBarrier; {6677#true} is VALID [2020-07-11 01:10:44,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-11 01:10:44,104 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6677#true} {6677#true} #147#return; {6677#true} is VALID [2020-07-11 01:10:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:44,157 INFO L280 TraceCheckUtils]: 0: Hoare triple {6740#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {6677#true} is VALID [2020-07-11 01:10:44,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := 0, 0; {6677#true} is VALID [2020-07-11 01:10:44,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,157 INFO L280 TraceCheckUtils]: 3: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-11 01:10:44,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-11 01:10:44,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,158 INFO L280 TraceCheckUtils]: 6: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-11 01:10:44,158 INFO L280 TraceCheckUtils]: 7: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,159 INFO L280 TraceCheckUtils]: 8: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-11 01:10:44,159 INFO L280 TraceCheckUtils]: 9: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-11 01:10:44,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-11 01:10:44,159 INFO L280 TraceCheckUtils]: 11: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,159 INFO L280 TraceCheckUtils]: 12: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-11 01:10:44,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-11 01:10:44,160 INFO L280 TraceCheckUtils]: 14: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,160 INFO L280 TraceCheckUtils]: 15: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-11 01:10:44,160 INFO L280 TraceCheckUtils]: 16: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,160 INFO L280 TraceCheckUtils]: 17: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-11 01:10:44,161 INFO L280 TraceCheckUtils]: 18: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-11 01:10:44,161 INFO L280 TraceCheckUtils]: 19: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-11 01:10:44,161 INFO L280 TraceCheckUtils]: 20: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-11 01:10:44,161 INFO L280 TraceCheckUtils]: 22: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-11 01:10:44,161 INFO L280 TraceCheckUtils]: 23: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,162 INFO L280 TraceCheckUtils]: 24: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-11 01:10:44,162 INFO L280 TraceCheckUtils]: 25: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,162 INFO L280 TraceCheckUtils]: 26: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-11 01:10:44,162 INFO L280 TraceCheckUtils]: 27: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-11 01:10:44,162 INFO L280 TraceCheckUtils]: 28: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-11 01:10:44,163 INFO L280 TraceCheckUtils]: 29: Hoare triple {6677#true} assume !(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,163 INFO L280 TraceCheckUtils]: 30: Hoare triple {6677#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,163 INFO L280 TraceCheckUtils]: 31: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-11 01:10:44,164 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {6677#true} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #141#return; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:44,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {6677#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6677#true} is VALID [2020-07-11 01:10:44,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {6677#true} ~len~0 := 0; {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-11 01:10:44,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0); {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-11 01:10:44,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} #t~post4 := ~len~0; {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} is VALID [2020-07-11 01:10:44,309 INFO L280 TraceCheckUtils]: 4: Hoare triple {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} ~len~0 := 1 + #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,313 INFO L280 TraceCheckUtils]: 9: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0); {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} #t~post4 := ~len~0; {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} is VALID [2020-07-11 01:10:44,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} ~len~0 := 1 + #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,318 INFO L280 TraceCheckUtils]: 14: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-11 01:10:44,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-11 01:10:44,322 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #143#return; {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-11 01:10:44,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {6677#true} call ULTIMATE.init(); {6739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:44,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {6739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6677#true} is VALID [2020-07-11 01:10:44,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {6677#true} #valid := #valid[0 := 0]; {6677#true} is VALID [2020-07-11 01:10:44,326 INFO L280 TraceCheckUtils]: 3: Hoare triple {6677#true} assume 0 < #StackHeapBarrier; {6677#true} is VALID [2020-07-11 01:10:44,327 INFO L280 TraceCheckUtils]: 4: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-11 01:10:44,327 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6677#true} {6677#true} #147#return; {6677#true} is VALID [2020-07-11 01:10:44,327 INFO L263 TraceCheckUtils]: 6: Hoare triple {6677#true} call #t~ret12 := main(); {6677#true} is VALID [2020-07-11 01:10:44,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {6677#true} ~len~1 := 2; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,329 INFO L280 TraceCheckUtils]: 8: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #t~short8 := ~len~1 < 32; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,330 INFO L280 TraceCheckUtils]: 9: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume #t~short8; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,330 INFO L280 TraceCheckUtils]: 10: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #t~short8 := 0 != #t~nondet7; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume !#t~short8; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} havoc #t~nondet7; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} havoc #t~short8; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,336 INFO L263 TraceCheckUtils]: 15: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {6740#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:44,336 INFO L280 TraceCheckUtils]: 16: Hoare triple {6740#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {6677#true} is VALID [2020-07-11 01:10:44,337 INFO L280 TraceCheckUtils]: 17: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := 0, 0; {6677#true} is VALID [2020-07-11 01:10:44,337 INFO L280 TraceCheckUtils]: 18: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-11 01:10:44,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-11 01:10:44,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-11 01:10:44,338 INFO L280 TraceCheckUtils]: 23: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,338 INFO L280 TraceCheckUtils]: 24: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-11 01:10:44,338 INFO L280 TraceCheckUtils]: 25: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-11 01:10:44,338 INFO L280 TraceCheckUtils]: 26: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-11 01:10:44,339 INFO L280 TraceCheckUtils]: 27: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,339 INFO L280 TraceCheckUtils]: 28: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-11 01:10:44,339 INFO L280 TraceCheckUtils]: 29: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-11 01:10:44,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,339 INFO L280 TraceCheckUtils]: 31: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-11 01:10:44,340 INFO L280 TraceCheckUtils]: 32: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,340 INFO L280 TraceCheckUtils]: 33: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-11 01:10:44,340 INFO L280 TraceCheckUtils]: 34: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-11 01:10:44,340 INFO L280 TraceCheckUtils]: 35: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-11 01:10:44,340 INFO L280 TraceCheckUtils]: 36: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,341 INFO L280 TraceCheckUtils]: 37: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-11 01:10:44,341 INFO L280 TraceCheckUtils]: 38: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-11 01:10:44,341 INFO L280 TraceCheckUtils]: 39: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,341 INFO L280 TraceCheckUtils]: 40: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-11 01:10:44,342 INFO L280 TraceCheckUtils]: 41: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,342 INFO L280 TraceCheckUtils]: 42: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-11 01:10:44,342 INFO L280 TraceCheckUtils]: 43: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-11 01:10:44,343 INFO L280 TraceCheckUtils]: 44: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-11 01:10:44,343 INFO L280 TraceCheckUtils]: 45: Hoare triple {6677#true} assume !(~len > 0); {6677#true} is VALID [2020-07-11 01:10:44,343 INFO L280 TraceCheckUtils]: 46: Hoare triple {6677#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6677#true} is VALID [2020-07-11 01:10:44,343 INFO L280 TraceCheckUtils]: 47: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-11 01:10:44,345 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {6677#true} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #141#return; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,346 INFO L280 TraceCheckUtils]: 49: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,346 INFO L280 TraceCheckUtils]: 50: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} havoc #t~ret10.base, #t~ret10.offset; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-11 01:10:44,347 INFO L263 TraceCheckUtils]: 51: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {6677#true} is VALID [2020-07-11 01:10:44,347 INFO L280 TraceCheckUtils]: 52: Hoare triple {6677#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6677#true} is VALID [2020-07-11 01:10:44,348 INFO L280 TraceCheckUtils]: 53: Hoare triple {6677#true} ~len~0 := 0; {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-11 01:10:44,348 INFO L280 TraceCheckUtils]: 54: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0); {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-11 01:10:44,349 INFO L280 TraceCheckUtils]: 55: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} #t~post4 := ~len~0; {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} is VALID [2020-07-11 01:10:44,350 INFO L280 TraceCheckUtils]: 56: Hoare triple {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} ~len~0 := 1 + #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,351 INFO L280 TraceCheckUtils]: 57: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,352 INFO L280 TraceCheckUtils]: 58: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,352 INFO L280 TraceCheckUtils]: 59: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,353 INFO L280 TraceCheckUtils]: 60: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,354 INFO L280 TraceCheckUtils]: 61: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0); {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-11 01:10:44,355 INFO L280 TraceCheckUtils]: 62: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} #t~post4 := ~len~0; {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} is VALID [2020-07-11 01:10:44,356 INFO L280 TraceCheckUtils]: 63: Hoare triple {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} ~len~0 := 1 + #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,356 INFO L280 TraceCheckUtils]: 64: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,357 INFO L280 TraceCheckUtils]: 65: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,358 INFO L280 TraceCheckUtils]: 66: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,359 INFO L280 TraceCheckUtils]: 67: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,360 INFO L280 TraceCheckUtils]: 68: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-11 01:10:44,361 INFO L280 TraceCheckUtils]: 69: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-11 01:10:44,361 INFO L280 TraceCheckUtils]: 70: Hoare triple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-11 01:10:44,363 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #143#return; {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-11 01:10:44,376 INFO L280 TraceCheckUtils]: 72: Hoare triple {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-11 01:10:44,377 INFO L280 TraceCheckUtils]: 73: Hoare triple {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} assume ~len~1 != #t~ret11; {6678#false} is VALID [2020-07-11 01:10:44,377 INFO L280 TraceCheckUtils]: 74: Hoare triple {6678#false} havoc #t~ret11; {6678#false} is VALID [2020-07-11 01:10:44,377 INFO L280 TraceCheckUtils]: 75: Hoare triple {6678#false} assume !false; {6678#false} is VALID [2020-07-11 01:10:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-11 01:10:44,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091779617] [2020-07-11 01:10:44,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:44,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 01:10:44,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537801933] [2020-07-11 01:10:44,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2020-07-11 01:10:44,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:44,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 01:10:44,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:44,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 01:10:44,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 01:10:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:10:44,457 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2020-07-11 01:10:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:46,465 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2020-07-11 01:10:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 01:10:46,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2020-07-11 01:10:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 01:10:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2020-07-11 01:10:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 01:10:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2020-07-11 01:10:46,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2020-07-11 01:10:46,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:46,658 INFO L225 Difference]: With dead ends: 125 [2020-07-11 01:10:46,658 INFO L226 Difference]: Without dead ends: 120 [2020-07-11 01:10:46,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2020-07-11 01:10:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-11 01:10:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2020-07-11 01:10:47,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:47,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 113 states. [2020-07-11 01:10:47,026 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 113 states. [2020-07-11 01:10:47,026 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 113 states. [2020-07-11 01:10:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:47,032 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-11 01:10:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-11 01:10:47,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:47,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:47,033 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 120 states. [2020-07-11 01:10:47,034 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 120 states. [2020-07-11 01:10:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:47,039 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-11 01:10:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-11 01:10:47,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:47,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:47,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:47,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-11 01:10:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2020-07-11 01:10:47,047 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 76 [2020-07-11 01:10:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:47,047 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2020-07-11 01:10:47,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 01:10:47,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 121 transitions. [2020-07-11 01:10:47,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2020-07-11 01:10:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-11 01:10:47,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:47,263 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:47,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 01:10:47,263 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash -446623556, now seen corresponding path program 2 times [2020-07-11 01:10:47,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:47,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641121652] [2020-07-11 01:10:47,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:47,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {7542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7488#true} is VALID [2020-07-11 01:10:47,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {7488#true} #valid := #valid[0 := 0]; {7488#true} is VALID [2020-07-11 01:10:47,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {7488#true} assume 0 < #StackHeapBarrier; {7488#true} is VALID [2020-07-11 01:10:47,338 INFO L280 TraceCheckUtils]: 3: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-11 01:10:47,339 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7488#true} {7488#true} #147#return; {7488#true} is VALID [2020-07-11 01:10:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:47,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {7543#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,486 INFO L280 TraceCheckUtils]: 5: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,487 INFO L280 TraceCheckUtils]: 6: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,487 INFO L280 TraceCheckUtils]: 7: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,488 INFO L280 TraceCheckUtils]: 8: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:47,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,493 INFO L280 TraceCheckUtils]: 15: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,494 INFO L280 TraceCheckUtils]: 16: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,495 INFO L280 TraceCheckUtils]: 17: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-11 01:10:47,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:47,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:47,497 INFO L280 TraceCheckUtils]: 20: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:47,498 INFO L280 TraceCheckUtils]: 21: Hoare triple {7549#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:47,498 INFO L280 TraceCheckUtils]: 22: Hoare triple {7549#(<= |sll_create_#in~len| 2)} assume true; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:47,500 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {7549#(<= |sll_create_#in~len| 2)} {7497#(<= 3 main_~len~1)} #141#return; {7489#false} is VALID [2020-07-11 01:10:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:47,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {7488#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {7488#true} is VALID [2020-07-11 01:10:47,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {7488#true} ~len~0 := 0; {7488#true} is VALID [2020-07-11 01:10:47,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-11 01:10:47,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-11 01:10:47,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,513 INFO L280 TraceCheckUtils]: 5: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,514 INFO L280 TraceCheckUtils]: 6: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-11 01:10:47,514 INFO L280 TraceCheckUtils]: 7: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,514 INFO L280 TraceCheckUtils]: 8: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-11 01:10:47,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-11 01:10:47,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,515 INFO L280 TraceCheckUtils]: 12: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,515 INFO L280 TraceCheckUtils]: 13: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-11 01:10:47,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,515 INFO L280 TraceCheckUtils]: 15: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,516 INFO L280 TraceCheckUtils]: 16: Hoare triple {7488#true} assume !(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-11 01:10:47,516 INFO L280 TraceCheckUtils]: 17: Hoare triple {7488#true} #res := ~len~0; {7488#true} is VALID [2020-07-11 01:10:47,516 INFO L280 TraceCheckUtils]: 18: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-11 01:10:47,516 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7488#true} {7489#false} #143#return; {7489#false} is VALID [2020-07-11 01:10:47,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {7488#true} call ULTIMATE.init(); {7542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:47,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {7542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7488#true} is VALID [2020-07-11 01:10:47,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {7488#true} #valid := #valid[0 := 0]; {7488#true} is VALID [2020-07-11 01:10:47,518 INFO L280 TraceCheckUtils]: 3: Hoare triple {7488#true} assume 0 < #StackHeapBarrier; {7488#true} is VALID [2020-07-11 01:10:47,519 INFO L280 TraceCheckUtils]: 4: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-11 01:10:47,519 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7488#true} {7488#true} #147#return; {7488#true} is VALID [2020-07-11 01:10:47,519 INFO L263 TraceCheckUtils]: 6: Hoare triple {7488#true} call #t~ret12 := main(); {7488#true} is VALID [2020-07-11 01:10:47,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {7488#true} ~len~1 := 2; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,520 INFO L280 TraceCheckUtils]: 8: Hoare triple {7495#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,521 INFO L280 TraceCheckUtils]: 9: Hoare triple {7495#(<= 2 main_~len~1)} assume #t~short8; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {7495#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {7495#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {7495#(<= 2 main_~len~1)} assume !!#t~short8; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {7495#(<= 2 main_~len~1)} havoc #t~nondet7; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {7495#(<= 2 main_~len~1)} havoc #t~short8; {7495#(<= 2 main_~len~1)} is VALID [2020-07-11 01:10:47,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {7495#(<= 2 main_~len~1)} #t~post9 := ~len~1; {7496#(<= 2 |main_#t~post9|)} is VALID [2020-07-11 01:10:47,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {7496#(<= 2 |main_#t~post9|)} ~len~1 := 1 + #t~post9; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {7497#(<= 3 main_~len~1)} havoc #t~post9; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {7497#(<= 3 main_~len~1)} #t~short8 := ~len~1 < 32; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {7497#(<= 3 main_~len~1)} assume #t~short8; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,527 INFO L280 TraceCheckUtils]: 20: Hoare triple {7497#(<= 3 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,528 INFO L280 TraceCheckUtils]: 21: Hoare triple {7497#(<= 3 main_~len~1)} #t~short8 := 0 != #t~nondet7; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,528 INFO L280 TraceCheckUtils]: 22: Hoare triple {7497#(<= 3 main_~len~1)} assume !#t~short8; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,529 INFO L280 TraceCheckUtils]: 23: Hoare triple {7497#(<= 3 main_~len~1)} havoc #t~nondet7; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,529 INFO L280 TraceCheckUtils]: 24: Hoare triple {7497#(<= 3 main_~len~1)} havoc #t~short8; {7497#(<= 3 main_~len~1)} is VALID [2020-07-11 01:10:47,531 INFO L263 TraceCheckUtils]: 25: Hoare triple {7497#(<= 3 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {7543#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 01:10:47,531 INFO L280 TraceCheckUtils]: 26: Hoare triple {7543#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,532 INFO L280 TraceCheckUtils]: 27: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,532 INFO L280 TraceCheckUtils]: 28: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,533 INFO L280 TraceCheckUtils]: 29: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,533 INFO L280 TraceCheckUtils]: 30: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,534 INFO L280 TraceCheckUtils]: 31: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,534 INFO L280 TraceCheckUtils]: 32: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,535 INFO L280 TraceCheckUtils]: 33: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-11 01:10:47,535 INFO L280 TraceCheckUtils]: 34: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-11 01:10:47,536 INFO L280 TraceCheckUtils]: 35: Hoare triple {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,537 INFO L280 TraceCheckUtils]: 36: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,538 INFO L280 TraceCheckUtils]: 37: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,538 INFO L280 TraceCheckUtils]: 38: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,539 INFO L280 TraceCheckUtils]: 39: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,539 INFO L280 TraceCheckUtils]: 40: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,540 INFO L280 TraceCheckUtils]: 41: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,540 INFO L280 TraceCheckUtils]: 42: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-11 01:10:47,541 INFO L280 TraceCheckUtils]: 43: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-11 01:10:47,542 INFO L280 TraceCheckUtils]: 44: Hoare triple {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:47,542 INFO L280 TraceCheckUtils]: 45: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-11 01:10:47,543 INFO L280 TraceCheckUtils]: 46: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:47,543 INFO L280 TraceCheckUtils]: 47: Hoare triple {7549#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:47,544 INFO L280 TraceCheckUtils]: 48: Hoare triple {7549#(<= |sll_create_#in~len| 2)} assume true; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-11 01:10:47,545 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7549#(<= |sll_create_#in~len| 2)} {7497#(<= 3 main_~len~1)} #141#return; {7489#false} is VALID [2020-07-11 01:10:47,546 INFO L280 TraceCheckUtils]: 50: Hoare triple {7489#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {7489#false} is VALID [2020-07-11 01:10:47,546 INFO L280 TraceCheckUtils]: 51: Hoare triple {7489#false} havoc #t~ret10.base, #t~ret10.offset; {7489#false} is VALID [2020-07-11 01:10:47,546 INFO L263 TraceCheckUtils]: 52: Hoare triple {7489#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {7488#true} is VALID [2020-07-11 01:10:47,546 INFO L280 TraceCheckUtils]: 53: Hoare triple {7488#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {7488#true} is VALID [2020-07-11 01:10:47,546 INFO L280 TraceCheckUtils]: 54: Hoare triple {7488#true} ~len~0 := 0; {7488#true} is VALID [2020-07-11 01:10:47,547 INFO L280 TraceCheckUtils]: 55: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-11 01:10:47,547 INFO L280 TraceCheckUtils]: 56: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-11 01:10:47,547 INFO L280 TraceCheckUtils]: 57: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,547 INFO L280 TraceCheckUtils]: 58: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,547 INFO L280 TraceCheckUtils]: 59: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-11 01:10:47,548 INFO L280 TraceCheckUtils]: 60: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,548 INFO L280 TraceCheckUtils]: 61: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,548 INFO L280 TraceCheckUtils]: 62: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-11 01:10:47,548 INFO L280 TraceCheckUtils]: 63: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-11 01:10:47,548 INFO L280 TraceCheckUtils]: 64: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,548 INFO L280 TraceCheckUtils]: 65: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-11 01:10:47,549 INFO L280 TraceCheckUtils]: 66: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-11 01:10:47,549 INFO L280 TraceCheckUtils]: 67: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,549 INFO L280 TraceCheckUtils]: 68: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-11 01:10:47,549 INFO L280 TraceCheckUtils]: 69: Hoare triple {7488#true} assume !(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-11 01:10:47,549 INFO L280 TraceCheckUtils]: 70: Hoare triple {7488#true} #res := ~len~0; {7488#true} is VALID [2020-07-11 01:10:47,550 INFO L280 TraceCheckUtils]: 71: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-11 01:10:47,550 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7488#true} {7489#false} #143#return; {7489#false} is VALID [2020-07-11 01:10:47,550 INFO L280 TraceCheckUtils]: 73: Hoare triple {7489#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {7489#false} is VALID [2020-07-11 01:10:47,550 INFO L280 TraceCheckUtils]: 74: Hoare triple {7489#false} assume ~len~1 != #t~ret11; {7489#false} is VALID [2020-07-11 01:10:47,550 INFO L280 TraceCheckUtils]: 75: Hoare triple {7489#false} havoc #t~ret11; {7489#false} is VALID [2020-07-11 01:10:47,550 INFO L280 TraceCheckUtils]: 76: Hoare triple {7489#false} assume !false; {7489#false} is VALID [2020-07-11 01:10:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-11 01:10:47,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641121652] [2020-07-11 01:10:47,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:47,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 01:10:47,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274225082] [2020-07-11 01:10:47,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2020-07-11 01:10:47,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:47,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 01:10:47,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:47,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 01:10:47,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:47,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 01:10:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-11 01:10:47,635 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 13 states. [2020-07-11 01:10:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:49,654 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2020-07-11 01:10:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 01:10:49,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2020-07-11 01:10:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 01:10:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2020-07-11 01:10:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 01:10:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2020-07-11 01:10:49,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2020-07-11 01:10:49,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:49,838 INFO L225 Difference]: With dead ends: 163 [2020-07-11 01:10:49,838 INFO L226 Difference]: Without dead ends: 122 [2020-07-11 01:10:49,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2020-07-11 01:10:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-11 01:10:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2020-07-11 01:10:50,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:50,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 110 states. [2020-07-11 01:10:50,210 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 110 states. [2020-07-11 01:10:50,210 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 110 states. [2020-07-11 01:10:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:50,214 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2020-07-11 01:10:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2020-07-11 01:10:50,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:50,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:50,215 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 122 states. [2020-07-11 01:10:50,216 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 122 states. [2020-07-11 01:10:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:50,219 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2020-07-11 01:10:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2020-07-11 01:10:50,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:50,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:50,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:50,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-11 01:10:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2020-07-11 01:10:50,223 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 77 [2020-07-11 01:10:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:50,224 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2020-07-11 01:10:50,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 01:10:50,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 117 transitions. [2020-07-11 01:10:50,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2020-07-11 01:10:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-11 01:10:50,458 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:50,458 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:50,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 01:10:50,459 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1305863211, now seen corresponding path program 5 times [2020-07-11 01:10:50,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:50,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1848496798] [2020-07-11 01:10:50,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:10:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:10:50,619 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:10:50,620 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:10:50,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 01:10:50,715 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:10:50,715 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-11 01:10:50,715 WARN L170 areAnnotationChecker]: sll_destroyENTRY has no Hoare annotation [2020-07-11 01:10:50,715 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-11 01:10:50,715 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: sll_createENTRY has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: sll_lengthENTRY has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: L561 has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-11 01:10:50,716 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-11 01:10:50,717 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-11 01:10:50,717 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:10:50,717 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:10:50,717 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-11 01:10:50,717 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2020-07-11 01:10:50,717 WARN L170 areAnnotationChecker]: L593-11 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: L593-11 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: L577 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2020-07-11 01:10:50,718 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L593-12 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L593-12 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-11 01:10:50,719 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: sll_destroyEXIT has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2020-07-11 01:10:50,720 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L586-2 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: sll_createFINAL has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L596-1 has no Hoare annotation [2020-07-11 01:10:50,721 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L593-9 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: sll_lengthFINAL has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L579-1 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L587 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: sll_createEXIT has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-11 01:10:50,722 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L593-7 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L593-10 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: sll_lengthEXIT has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L579-2 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2020-07-11 01:10:50,723 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L580 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L580-1 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L572 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L597-3 has no Hoare annotation [2020-07-11 01:10:50,724 WARN L170 areAnnotationChecker]: L597-4 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L580-2 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L572-1 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L572-2 has no Hoare annotation [2020-07-11 01:10:50,725 WARN L170 areAnnotationChecker]: L603 has no Hoare annotation [2020-07-11 01:10:50,726 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-11 01:10:50,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:10:50 BoogieIcfgContainer [2020-07-11 01:10:50,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:10:50,740 INFO L168 Benchmark]: Toolchain (without parser) took 31673.87 ms. Allocated memory was 147.8 MB in the beginning and 486.0 MB in the end (delta: 338.2 MB). Free memory was 105.2 MB in the beginning and 347.7 MB in the end (delta: -242.5 MB). Peak memory consumption was 95.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:50,742 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 124.5 MB in the beginning and 124.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 01:10:50,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.64 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 104.8 MB in the beginning and 170.3 MB in the end (delta: -65.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:50,743 INFO L168 Benchmark]: Boogie Preprocessor took 75.02 ms. Allocated memory is still 204.5 MB. Free memory was 170.3 MB in the beginning and 167.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:50,743 INFO L168 Benchmark]: RCFGBuilder took 834.33 ms. Allocated memory is still 204.5 MB. Free memory was 167.1 MB in the beginning and 109.4 MB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:50,745 INFO L168 Benchmark]: TraceAbstraction took 30046.36 ms. Allocated memory was 204.5 MB in the beginning and 486.0 MB in the end (delta: 281.5 MB). Free memory was 108.8 MB in the beginning and 347.7 MB in the end (delta: -239.0 MB). Peak memory consumption was 42.6 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:50,752 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.21 ms. Allocated memory is still 147.8 MB. Free memory was 124.5 MB in the beginning and 124.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.64 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 104.8 MB in the beginning and 170.3 MB in the end (delta: -65.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.02 ms. Allocated memory is still 204.5 MB. Free memory was 170.3 MB in the beginning and 167.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.33 ms. Allocated memory is still 204.5 MB. Free memory was 167.1 MB in the beginning and 109.4 MB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30046.36 ms. Allocated memory was 204.5 MB in the beginning and 486.0 MB in the end (delta: 281.5 MB). Free memory was 108.8 MB in the beginning and 347.7 MB in the end (delta: -239.0 MB). Peak memory consumption was 42.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() VAL [len=2, len < 32 && __VERIFIER_nondet_int()=1] [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 VAL [\old(len)=3, head={0:0}, len=3] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L570] new_head->next = head VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] head = new_head VAL [\old(len)=3, head={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L572] len-- VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] COND TRUE len > 0 VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L570] new_head->next = head VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] head = new_head VAL [\old(len)=3, head={-2:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L572] len-- VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] COND TRUE len > 0 VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L570] new_head->next = head VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L571] head = new_head VAL [\old(len)=3, head={-3:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L572] len-- VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] return head; VAL [\old(len)=3, \result={-3:0}, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={-3:0}] [L596] SLL s = sll_create(len + 1); VAL [len=2, s={-3:0}, sll_create(len + 1)={-3:0}] [L597] CALL, EXPR sll_length(s) VAL [head={-3:0}] [L577] int len = 0; VAL [head={-3:0}, head={-3:0}, len=0] [L578] COND TRUE \read(head) VAL [head={-3:0}, head={-3:0}, len=0] [L579] len++ VAL [head={-3:0}, head={-3:0}, len=1] [L580] EXPR head->next VAL [head={-3:0}, head={-3:0}, head->next={-2:0}, len=1] [L580] head = head->next VAL [head={-3:0}, head={-2:0}, head->next={-2:0}, len=1] [L578] COND TRUE \read(head) VAL [head={-2:0}, head={-3:0}, len=1] [L579] len++ VAL [head={-3:0}, head={-2:0}, len=2] [L580] EXPR head->next VAL [head={-2:0}, head={-3:0}, head->next={-1:0}, len=2] [L580] head = head->next VAL [head={-1:0}, head={-3:0}, head->next={-1:0}, len=2] [L578] COND TRUE \read(head) VAL [head={-3:0}, head={-1:0}, len=2] [L579] len++ VAL [head={-3:0}, head={-1:0}, len=3] [L580] EXPR head->next VAL [head={-1:0}, head={-3:0}, head->next={0:0}, len=3] [L580] head = head->next VAL [head={0:0}, head={-3:0}, head->next={0:0}, len=3] [L578] COND FALSE !(\read(head)) VAL [head={-3:0}, head={0:0}, len=3] [L582] return len; VAL [\result=3, head={0:0}, head={-3:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L602] __VERIFIER_error() VAL [len=2, s={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.8s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 704 SDtfs, 1509 SDslu, 1656 SDs, 0 SdLazy, 3621 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 220 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 98952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 81/125 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...