/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:05:09,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:05:09,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:05:09,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:05:09,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:05:09,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:05:09,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:05:09,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:05:09,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:05:09,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:05:09,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:05:09,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:05:09,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:05:09,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:05:09,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:05:09,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:05:09,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:05:09,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:05:09,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:05:09,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:05:09,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:05:09,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:05:09,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:05:09,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:05:09,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:05:09,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:05:09,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:05:09,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:05:09,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:05:09,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:05:09,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:05:09,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:05:09,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:05:09,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:05:09,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:05:09,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:05:09,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:05:09,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:05:09,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:05:09,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:05:09,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:05:09,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:05:09,566 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:05:09,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:05:09,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:05:09,570 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:05:09,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:05:09,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:05:09,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:05:09,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:05:09,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:05:09,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:05:09,572 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:05:09,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:05:09,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:05:09,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:05:09,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:05:09,576 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:05:09,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:05:09,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:05:09,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:05:09,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:05:09,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:05:09,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:05:09,578 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:05:09,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:05:09,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:05:09,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:05:09,977 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:05:09,978 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:05:09,979 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-10 19:05:10,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdaeeda00/f4fcd5648d604db0b8815ba60cbc97ff/FLAG149c92fd4 [2020-07-10 19:05:10,676 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:05:10,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-10 19:05:10,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdaeeda00/f4fcd5648d604db0b8815ba60cbc97ff/FLAG149c92fd4 [2020-07-10 19:05:11,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdaeeda00/f4fcd5648d604db0b8815ba60cbc97ff [2020-07-10 19:05:11,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:05:11,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:05:11,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:05:11,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:05:11,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:05:11,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77eacc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11, skipping insertion in model container [2020-07-10 19:05:11,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:05:11,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:05:11,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:05:11,623 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:05:11,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:05:11,789 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:05:11,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11 WrapperNode [2020-07-10 19:05:11,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:05:11,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:05:11,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:05:11,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:05:11,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... [2020-07-10 19:05:11,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:05:11,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:05:11,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:05:11,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:05:11,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:05:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:05:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:05:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 19:05:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 19:05:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 19:05:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-07-10 19:05:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-07-10 19:05:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-07-10 19:05:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:05:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:05:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:05:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 19:05:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 19:05:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:05:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:05:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:05:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:05:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:05:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:05:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:05:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:05:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:05:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:05:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:05:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:05:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:05:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:05:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:05:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:05:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:05:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:05:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:05:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:05:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:05:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:05:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:05:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:05:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:05:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:05:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:05:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:05:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:05:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:05:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:05:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:05:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:05:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:05:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:05:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:05:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:05:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:05:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:05:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:05:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:05:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:05:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:05:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:05:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:05:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:05:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:05:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:05:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:05:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:05:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:05:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:05:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:05:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:05:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:05:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:05:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:05:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:05:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:05:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:05:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 19:05:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-07-10 19:05:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:05:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:05:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-07-10 19:05:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:05:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-07-10 19:05:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:05:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:05:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:05:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:05:12,381 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 19:05:12,729 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:05:12,730 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 19:05:12,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:05:12 BoogieIcfgContainer [2020-07-10 19:05:12,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:05:12,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:05:12,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:05:12,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:05:12,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:05:11" (1/3) ... [2020-07-10 19:05:12,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636f7ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:05:12, skipping insertion in model container [2020-07-10 19:05:12,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:11" (2/3) ... [2020-07-10 19:05:12,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636f7ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:05:12, skipping insertion in model container [2020-07-10 19:05:12,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:05:12" (3/3) ... [2020-07-10 19:05:12,745 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-07-10 19:05:12,757 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:05:12,767 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:05:12,783 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:05:12,805 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:05:12,805 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:05:12,805 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:05:12,806 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:05:12,806 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:05:12,806 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:05:12,806 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:05:12,806 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:05:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-07-10 19:05:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 19:05:12,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:12,839 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-10 19:05:12,840 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1731717969, now seen corresponding path program 1 times [2020-07-10 19:05:12,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:12,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850538614] [2020-07-10 19:05:12,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:13,109 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-10 19:05:13,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-10 19:05:13,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-10 19:05:13,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-10 19:05:13,111 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {78#true} {78#true} #147#return; {78#true} is VALID [2020-07-10 19:05:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:13,153 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-10 19:05:13,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} ~head~0.base, ~head~0.offset := 0, 0; {78#true} is VALID [2020-07-10 19:05:13,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !(~len > 0); {78#true} is VALID [2020-07-10 19:05:13,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {78#true} is VALID [2020-07-10 19:05:13,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-10 19:05:13,155 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {79#false} #141#return; {79#false} is VALID [2020-07-10 19:05:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:13,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {78#true} is VALID [2020-07-10 19:05:13,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} ~len~0 := 0; {78#true} is VALID [2020-07-10 19:05:13,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !(~head.base != 0 || ~head.offset != 0); {78#true} is VALID [2020-07-10 19:05:13,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} #res := ~len~0; {78#true} is VALID [2020-07-10 19:05:13,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-10 19:05:13,172 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {79#false} #143#return; {79#false} is VALID [2020-07-10 19:05:13,174 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-10 19:05:13,174 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-10 19:05:13,174 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-10 19:05:13,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-10 19:05:13,175 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-10 19:05:13,176 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {78#true} #147#return; {78#true} is VALID [2020-07-10 19:05:13,176 INFO L263 TraceCheckUtils]: 6: Hoare triple {78#true} call #t~ret12 := main(); {78#true} is VALID [2020-07-10 19:05:13,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {78#true} ~len~1 := 2; {78#true} is VALID [2020-07-10 19:05:13,177 INFO L280 TraceCheckUtils]: 8: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-10 19:05:13,178 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-10 19:05:13,178 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-10 19:05:13,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {78#true} ~head~0.base, ~head~0.offset := 0, 0; {78#true} is VALID [2020-07-10 19:05:13,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {78#true} assume !(~len > 0); {78#true} is VALID [2020-07-10 19:05:13,179 INFO L280 TraceCheckUtils]: 13: Hoare triple {78#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {78#true} is VALID [2020-07-10 19:05:13,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-10 19:05:13,180 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {78#true} {79#false} #141#return; {79#false} is VALID [2020-07-10 19:05:13,180 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-10 19:05:13,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#false} havoc #t~ret10.base, #t~ret10.offset; {79#false} is VALID [2020-07-10 19:05:13,181 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-10 19:05:13,181 INFO L280 TraceCheckUtils]: 19: Hoare triple {78#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {78#true} is VALID [2020-07-10 19:05:13,182 INFO L280 TraceCheckUtils]: 20: Hoare triple {78#true} ~len~0 := 0; {78#true} is VALID [2020-07-10 19:05:13,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {78#true} assume !(~head.base != 0 || ~head.offset != 0); {78#true} is VALID [2020-07-10 19:05:13,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {78#true} #res := ~len~0; {78#true} is VALID [2020-07-10 19:05:13,183 INFO L280 TraceCheckUtils]: 23: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-10 19:05:13,183 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {78#true} {79#false} #143#return; {79#false} is VALID [2020-07-10 19:05:13,183 INFO L280 TraceCheckUtils]: 25: Hoare triple {79#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {79#false} is VALID [2020-07-10 19:05:13,184 INFO L280 TraceCheckUtils]: 26: Hoare triple {79#false} assume ~len~1 != #t~ret11; {79#false} is VALID [2020-07-10 19:05:13,184 INFO L280 TraceCheckUtils]: 27: Hoare triple {79#false} havoc #t~ret11; {79#false} is VALID [2020-07-10 19:05:13,184 INFO L280 TraceCheckUtils]: 28: Hoare triple {79#false} assume !false; {79#false} is VALID [2020-07-10 19:05:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:13,190 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:13,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850538614] [2020-07-10 19:05:13,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:13,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:05:13,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269049470] [2020-07-10 19:05:13,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 19:05:13,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:13,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:05:13,264 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-10 19:05:13,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:05:13,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:13,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:05:13,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:05:13,278 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2020-07-10 19:05:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:14,177 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2020-07-10 19:05:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:05:14,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 19:05:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2020-07-10 19:05:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2020-07-10 19:05:14,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2020-07-10 19:05:14,507 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-10 19:05:14,545 INFO L225 Difference]: With dead ends: 154 [2020-07-10 19:05:14,545 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 19:05:14,552 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-10 19:05:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 19:05:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2020-07-10 19:05:14,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:14,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 55 states. [2020-07-10 19:05:14,706 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 55 states. [2020-07-10 19:05:14,706 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 55 states. [2020-07-10 19:05:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:14,723 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 19:05:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 19:05:14,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:14,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:14,727 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 68 states. [2020-07-10 19:05:14,727 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 68 states. [2020-07-10 19:05:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:14,746 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 19:05:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 19:05:14,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:14,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:14,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:14,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 19:05:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-10 19:05:14,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 29 [2020-07-10 19:05:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:14,762 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-10 19:05:14,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:05:14,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-10 19:05:14,873 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-10 19:05:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 19:05:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 19:05:14,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:14,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:14,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:05:14,879 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:14,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:14,881 INFO L82 PathProgramCache]: Analyzing trace with hash 632987872, now seen corresponding path program 1 times [2020-07-10 19:05:14,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:14,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351201941] [2020-07-10 19:05:14,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:15,001 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-10 19:05:15,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} #valid := #valid[0 := 0]; {658#true} is VALID [2020-07-10 19:05:15,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume 0 < #StackHeapBarrier; {658#true} is VALID [2020-07-10 19:05:15,002 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-10 19:05:15,002 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {658#true} {658#true} #147#return; {658#true} is VALID [2020-07-10 19:05:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:15,032 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-10 19:05:15,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} ~head~0.base, ~head~0.offset := 0, 0; {658#true} is VALID [2020-07-10 19:05:15,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume !(~len > 0); {658#true} is VALID [2020-07-10 19:05:15,033 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {658#true} is VALID [2020-07-10 19:05:15,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-10 19:05:15,034 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {659#false} #141#return; {659#false} is VALID [2020-07-10 19:05:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:15,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {658#true} is VALID [2020-07-10 19:05:15,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} ~len~0 := 0; {658#true} is VALID [2020-07-10 19:05:15,047 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2020-07-10 19:05:15,047 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2020-07-10 19:05:15,048 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-10 19:05:15,048 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {659#false} #143#return; {659#false} is VALID [2020-07-10 19:05:15,049 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-10 19:05:15,050 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-10 19:05:15,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} #valid := #valid[0 := 0]; {658#true} is VALID [2020-07-10 19:05:15,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} assume 0 < #StackHeapBarrier; {658#true} is VALID [2020-07-10 19:05:15,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-10 19:05:15,051 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {658#true} #147#return; {658#true} is VALID [2020-07-10 19:05:15,051 INFO L263 TraceCheckUtils]: 6: Hoare triple {658#true} call #t~ret12 := main(); {658#true} is VALID [2020-07-10 19:05:15,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {658#true} ~len~1 := 2; {665#(<= main_~len~1 2)} is VALID [2020-07-10 19:05:15,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#(<= main_~len~1 2)} #t~short8 := ~len~1 < 32; {666#|main_#t~short8|} is VALID [2020-07-10 19:05:15,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {666#|main_#t~short8|} assume !#t~short8; {659#false} is VALID [2020-07-10 19:05:15,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#false} assume !#t~short8; {659#false} is VALID [2020-07-10 19:05:15,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {659#false} havoc #t~short8; {659#false} is VALID [2020-07-10 19:05:15,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {659#false} havoc #t~nondet7; {659#false} is VALID [2020-07-10 19:05:15,056 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-10 19:05:15,056 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-10 19:05:15,057 INFO L280 TraceCheckUtils]: 15: Hoare triple {658#true} ~head~0.base, ~head~0.offset := 0, 0; {658#true} is VALID [2020-07-10 19:05:15,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {658#true} assume !(~len > 0); {658#true} is VALID [2020-07-10 19:05:15,057 INFO L280 TraceCheckUtils]: 17: Hoare triple {658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {658#true} is VALID [2020-07-10 19:05:15,058 INFO L280 TraceCheckUtils]: 18: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-10 19:05:15,058 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {658#true} {659#false} #141#return; {659#false} is VALID [2020-07-10 19:05:15,058 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-10 19:05:15,059 INFO L280 TraceCheckUtils]: 21: Hoare triple {659#false} havoc #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2020-07-10 19:05:15,059 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-10 19:05:15,059 INFO L280 TraceCheckUtils]: 23: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {658#true} is VALID [2020-07-10 19:05:15,059 INFO L280 TraceCheckUtils]: 24: Hoare triple {658#true} ~len~0 := 0; {658#true} is VALID [2020-07-10 19:05:15,060 INFO L280 TraceCheckUtils]: 25: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2020-07-10 19:05:15,060 INFO L280 TraceCheckUtils]: 26: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2020-07-10 19:05:15,060 INFO L280 TraceCheckUtils]: 27: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-10 19:05:15,061 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {658#true} {659#false} #143#return; {659#false} is VALID [2020-07-10 19:05:15,061 INFO L280 TraceCheckUtils]: 29: Hoare triple {659#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {659#false} is VALID [2020-07-10 19:05:15,061 INFO L280 TraceCheckUtils]: 30: Hoare triple {659#false} assume ~len~1 != #t~ret11; {659#false} is VALID [2020-07-10 19:05:15,062 INFO L280 TraceCheckUtils]: 31: Hoare triple {659#false} havoc #t~ret11; {659#false} is VALID [2020-07-10 19:05:15,062 INFO L280 TraceCheckUtils]: 32: Hoare triple {659#false} assume !false; {659#false} is VALID [2020-07-10 19:05:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:15,064 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:15,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351201941] [2020-07-10 19:05:15,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:15,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:05:15,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730572060] [2020-07-10 19:05:15,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-10 19:05:15,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:15,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:05:15,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:15,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:05:15,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:05:15,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:05:15,106 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2020-07-10 19:05:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:16,196 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-07-10 19:05:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 19:05:16,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-10 19:05:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:05:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2020-07-10 19:05:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:05:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2020-07-10 19:05:16,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 154 transitions. [2020-07-10 19:05:16,399 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-10 19:05:16,405 INFO L225 Difference]: With dead ends: 143 [2020-07-10 19:05:16,406 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 19:05:16,408 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-10 19:05:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 19:05:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2020-07-10 19:05:16,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:16,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 57 states. [2020-07-10 19:05:16,523 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 57 states. [2020-07-10 19:05:16,523 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 57 states. [2020-07-10 19:05:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:16,541 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-10 19:05:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-10 19:05:16,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:16,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:16,544 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 96 states. [2020-07-10 19:05:16,544 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 96 states. [2020-07-10 19:05:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:16,550 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-10 19:05:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-10 19:05:16,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:16,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:16,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 19:05:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-10 19:05:16,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 33 [2020-07-10 19:05:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:16,555 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-10 19:05:16,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:05:16,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-10 19:05:16,640 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-10 19:05:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-10 19:05:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 19:05:16,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:16,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:16,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:05:16,642 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1134974621, now seen corresponding path program 1 times [2020-07-10 19:05:16,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:16,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1341133644] [2020-07-10 19:05:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:16,738 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-10 19:05:16,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} #valid := #valid[0 := 0]; {1284#true} is VALID [2020-07-10 19:05:16,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume 0 < #StackHeapBarrier; {1284#true} is VALID [2020-07-10 19:05:16,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-10 19:05:16,739 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1284#true} {1284#true} #147#return; {1284#true} is VALID [2020-07-10 19:05:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:16,839 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-10 19:05:16,840 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-10 19:05:16,841 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-10 19:05:16,842 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-10 19:05:16,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {1307#(<= |sll_create_#in~len| 0)} assume true; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-10 19:05:16,845 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-10 19:05:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:16,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1284#true} is VALID [2020-07-10 19:05:16,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} ~len~0 := 0; {1284#true} is VALID [2020-07-10 19:05:16,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume !(~head.base != 0 || ~head.offset != 0); {1284#true} is VALID [2020-07-10 19:05:16,853 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} #res := ~len~0; {1284#true} is VALID [2020-07-10 19:05:16,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-10 19:05:16,854 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1284#true} {1285#false} #143#return; {1285#false} is VALID [2020-07-10 19:05:16,855 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-10 19:05:16,855 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-10 19:05:16,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} #valid := #valid[0 := 0]; {1284#true} is VALID [2020-07-10 19:05:16,856 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume 0 < #StackHeapBarrier; {1284#true} is VALID [2020-07-10 19:05:16,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-10 19:05:16,856 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1284#true} {1284#true} #147#return; {1284#true} is VALID [2020-07-10 19:05:16,856 INFO L263 TraceCheckUtils]: 6: Hoare triple {1284#true} call #t~ret12 := main(); {1284#true} is VALID [2020-07-10 19:05:16,857 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} ~len~1 := 2; {1291#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:16,858 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-10 19:05:16,859 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(<= 2 main_~len~1)} assume #t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:16,859 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-10 19:05:16,860 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-10 19:05:16,860 INFO L280 TraceCheckUtils]: 12: Hoare triple {1291#(<= 2 main_~len~1)} assume !#t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:16,861 INFO L280 TraceCheckUtils]: 13: Hoare triple {1291#(<= 2 main_~len~1)} havoc #t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:16,862 INFO L280 TraceCheckUtils]: 14: Hoare triple {1291#(<= 2 main_~len~1)} havoc #t~nondet7; {1291#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:16,863 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-10 19:05:16,864 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-10 19:05:16,864 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-10 19:05:16,865 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-10 19:05:16,866 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-10 19:05:16,866 INFO L280 TraceCheckUtils]: 20: Hoare triple {1307#(<= |sll_create_#in~len| 0)} assume true; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-10 19:05:16,868 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-10 19:05:16,868 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-10 19:05:16,868 INFO L280 TraceCheckUtils]: 23: Hoare triple {1285#false} havoc #t~ret10.base, #t~ret10.offset; {1285#false} is VALID [2020-07-10 19:05:16,869 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-10 19:05:16,869 INFO L280 TraceCheckUtils]: 25: Hoare triple {1284#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1284#true} is VALID [2020-07-10 19:05:16,869 INFO L280 TraceCheckUtils]: 26: Hoare triple {1284#true} ~len~0 := 0; {1284#true} is VALID [2020-07-10 19:05:16,869 INFO L280 TraceCheckUtils]: 27: Hoare triple {1284#true} assume !(~head.base != 0 || ~head.offset != 0); {1284#true} is VALID [2020-07-10 19:05:16,870 INFO L280 TraceCheckUtils]: 28: Hoare triple {1284#true} #res := ~len~0; {1284#true} is VALID [2020-07-10 19:05:16,870 INFO L280 TraceCheckUtils]: 29: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-10 19:05:16,870 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1284#true} {1285#false} #143#return; {1285#false} is VALID [2020-07-10 19:05:16,871 INFO L280 TraceCheckUtils]: 31: Hoare triple {1285#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1285#false} is VALID [2020-07-10 19:05:16,871 INFO L280 TraceCheckUtils]: 32: Hoare triple {1285#false} assume ~len~1 != #t~ret11; {1285#false} is VALID [2020-07-10 19:05:16,871 INFO L280 TraceCheckUtils]: 33: Hoare triple {1285#false} havoc #t~ret11; {1285#false} is VALID [2020-07-10 19:05:16,871 INFO L280 TraceCheckUtils]: 34: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-10 19:05:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:16,874 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:16,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1341133644] [2020-07-10 19:05:16,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:16,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:05:16,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225530915] [2020-07-10 19:05:16,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 19:05:16,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:16,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:05:16,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:16,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:05:16,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:05:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:05:16,914 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 7 states. [2020-07-10 19:05:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:17,984 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-10 19:05:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 19:05:17,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 19:05:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:05:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-10 19:05:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:05:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-10 19:05:17,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 121 transitions. [2020-07-10 19:05:18,174 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-10 19:05:18,179 INFO L225 Difference]: With dead ends: 114 [2020-07-10 19:05:18,179 INFO L226 Difference]: Without dead ends: 94 [2020-07-10 19:05:18,180 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-10 19:05:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-10 19:05:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2020-07-10 19:05:18,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:18,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 67 states. [2020-07-10 19:05:18,307 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 67 states. [2020-07-10 19:05:18,307 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 67 states. [2020-07-10 19:05:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:18,312 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-10 19:05:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-10 19:05:18,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:18,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:18,314 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 94 states. [2020-07-10 19:05:18,314 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 94 states. [2020-07-10 19:05:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:18,319 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-10 19:05:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-10 19:05:18,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:18,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:18,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:18,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-10 19:05:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-07-10 19:05:18,324 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 35 [2020-07-10 19:05:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:18,324 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-07-10 19:05:18,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:05:18,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 73 transitions. [2020-07-10 19:05:18,431 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-10 19:05:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-07-10 19:05:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 19:05:18,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:18,434 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-10 19:05:18,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:05:18,434 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 226602169, now seen corresponding path program 1 times [2020-07-10 19:05:18,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:18,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495026385] [2020-07-10 19:05:18,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:18,587 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-10 19:05:18,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} #valid := #valid[0 := 0]; {1869#true} is VALID [2020-07-10 19:05:18,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume 0 < #StackHeapBarrier; {1869#true} is VALID [2020-07-10 19:05:18,588 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-10 19:05:18,588 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1869#true} {1869#true} #147#return; {1869#true} is VALID [2020-07-10 19:05:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:18,611 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-10 19:05:18,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} ~head~0.base, ~head~0.offset := 0, 0; {1869#true} is VALID [2020-07-10 19:05:18,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume !(~len > 0); {1869#true} is VALID [2020-07-10 19:05:18,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1869#true} is VALID [2020-07-10 19:05:18,612 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-10 19:05:18,613 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1870#false} #141#return; {1870#false} is VALID [2020-07-10 19:05:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:18,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {1869#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1869#true} is VALID [2020-07-10 19:05:18,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} ~len~0 := 0; {1869#true} is VALID [2020-07-10 19:05:18,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume !(~head.base != 0 || ~head.offset != 0); {1869#true} is VALID [2020-07-10 19:05:18,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} #res := ~len~0; {1869#true} is VALID [2020-07-10 19:05:18,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-10 19:05:18,621 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1870#false} #143#return; {1870#false} is VALID [2020-07-10 19:05:18,622 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-10 19:05:18,623 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-10 19:05:18,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} #valid := #valid[0 := 0]; {1869#true} is VALID [2020-07-10 19:05:18,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} assume 0 < #StackHeapBarrier; {1869#true} is VALID [2020-07-10 19:05:18,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-10 19:05:18,624 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1869#true} #147#return; {1869#true} is VALID [2020-07-10 19:05:18,624 INFO L263 TraceCheckUtils]: 6: Hoare triple {1869#true} call #t~ret12 := main(); {1869#true} is VALID [2020-07-10 19:05:18,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {1869#true} ~len~1 := 2; {1876#(<= main_~len~1 2)} is VALID [2020-07-10 19:05:18,626 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-10 19:05:18,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {1876#(<= main_~len~1 2)} assume #t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-10 19:05:18,627 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-10 19:05:18,628 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-10 19:05:18,629 INFO L280 TraceCheckUtils]: 12: Hoare triple {1876#(<= main_~len~1 2)} assume !!#t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-10 19:05:18,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {1876#(<= main_~len~1 2)} havoc #t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-10 19:05:18,630 INFO L280 TraceCheckUtils]: 14: Hoare triple {1876#(<= main_~len~1 2)} havoc #t~nondet7; {1876#(<= main_~len~1 2)} is VALID [2020-07-10 19:05:18,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {1876#(<= main_~len~1 2)} #t~post9 := ~len~1; {1877#(<= |main_#t~post9| 2)} is VALID [2020-07-10 19:05:18,632 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-10 19:05:18,633 INFO L280 TraceCheckUtils]: 17: Hoare triple {1878#(<= main_~len~1 3)} havoc #t~post9; {1878#(<= main_~len~1 3)} is VALID [2020-07-10 19:05:18,634 INFO L280 TraceCheckUtils]: 18: Hoare triple {1878#(<= main_~len~1 3)} #t~short8 := ~len~1 < 32; {1879#|main_#t~short8|} is VALID [2020-07-10 19:05:18,634 INFO L280 TraceCheckUtils]: 19: Hoare triple {1879#|main_#t~short8|} assume !#t~short8; {1870#false} is VALID [2020-07-10 19:05:18,635 INFO L280 TraceCheckUtils]: 20: Hoare triple {1870#false} assume !#t~short8; {1870#false} is VALID [2020-07-10 19:05:18,635 INFO L280 TraceCheckUtils]: 21: Hoare triple {1870#false} havoc #t~short8; {1870#false} is VALID [2020-07-10 19:05:18,635 INFO L280 TraceCheckUtils]: 22: Hoare triple {1870#false} havoc #t~nondet7; {1870#false} is VALID [2020-07-10 19:05:18,636 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-10 19:05:18,636 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-10 19:05:18,636 INFO L280 TraceCheckUtils]: 25: Hoare triple {1869#true} ~head~0.base, ~head~0.offset := 0, 0; {1869#true} is VALID [2020-07-10 19:05:18,636 INFO L280 TraceCheckUtils]: 26: Hoare triple {1869#true} assume !(~len > 0); {1869#true} is VALID [2020-07-10 19:05:18,637 INFO L280 TraceCheckUtils]: 27: Hoare triple {1869#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1869#true} is VALID [2020-07-10 19:05:18,637 INFO L280 TraceCheckUtils]: 28: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-10 19:05:18,637 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1869#true} {1870#false} #141#return; {1870#false} is VALID [2020-07-10 19:05:18,637 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-10 19:05:18,638 INFO L280 TraceCheckUtils]: 31: Hoare triple {1870#false} havoc #t~ret10.base, #t~ret10.offset; {1870#false} is VALID [2020-07-10 19:05:18,638 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-10 19:05:18,638 INFO L280 TraceCheckUtils]: 33: Hoare triple {1869#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1869#true} is VALID [2020-07-10 19:05:18,638 INFO L280 TraceCheckUtils]: 34: Hoare triple {1869#true} ~len~0 := 0; {1869#true} is VALID [2020-07-10 19:05:18,639 INFO L280 TraceCheckUtils]: 35: Hoare triple {1869#true} assume !(~head.base != 0 || ~head.offset != 0); {1869#true} is VALID [2020-07-10 19:05:18,639 INFO L280 TraceCheckUtils]: 36: Hoare triple {1869#true} #res := ~len~0; {1869#true} is VALID [2020-07-10 19:05:18,639 INFO L280 TraceCheckUtils]: 37: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-10 19:05:18,639 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1869#true} {1870#false} #143#return; {1870#false} is VALID [2020-07-10 19:05:18,640 INFO L280 TraceCheckUtils]: 39: Hoare triple {1870#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1870#false} is VALID [2020-07-10 19:05:18,640 INFO L280 TraceCheckUtils]: 40: Hoare triple {1870#false} assume ~len~1 != #t~ret11; {1870#false} is VALID [2020-07-10 19:05:18,640 INFO L280 TraceCheckUtils]: 41: Hoare triple {1870#false} havoc #t~ret11; {1870#false} is VALID [2020-07-10 19:05:18,641 INFO L280 TraceCheckUtils]: 42: Hoare triple {1870#false} assume !false; {1870#false} is VALID [2020-07-10 19:05:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:18,643 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:18,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495026385] [2020-07-10 19:05:18,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:18,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:05:18,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22949822] [2020-07-10 19:05:18,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-07-10 19:05:18,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:18,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:05:18,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:18,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:05:18,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:05:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:05:18,686 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2020-07-10 19:05:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:20,168 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2020-07-10 19:05:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 19:05:20,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-07-10 19:05:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:05:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2020-07-10 19:05:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:05:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2020-07-10 19:05:20,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2020-07-10 19:05:20,397 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-10 19:05:20,402 INFO L225 Difference]: With dead ends: 168 [2020-07-10 19:05:20,402 INFO L226 Difference]: Without dead ends: 117 [2020-07-10 19:05:20,403 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-10 19:05:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-10 19:05:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2020-07-10 19:05:20,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:20,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 74 states. [2020-07-10 19:05:20,543 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 74 states. [2020-07-10 19:05:20,543 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 74 states. [2020-07-10 19:05:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:20,549 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-10 19:05:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-10 19:05:20,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:20,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:20,550 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 117 states. [2020-07-10 19:05:20,550 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 117 states. [2020-07-10 19:05:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:20,560 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-10 19:05:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-10 19:05:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:20,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:20,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:20,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 19:05:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2020-07-10 19:05:20,565 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 43 [2020-07-10 19:05:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:20,566 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2020-07-10 19:05:20,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:05:20,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 80 transitions. [2020-07-10 19:05:20,705 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-10 19:05:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2020-07-10 19:05:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 19:05:20,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:20,707 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-10 19:05:20,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:05:20,708 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 360366586, now seen corresponding path program 1 times [2020-07-10 19:05:20,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:20,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202833521] [2020-07-10 19:05:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:20,849 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-10 19:05:20,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {2631#true} #valid := #valid[0 := 0]; {2631#true} is VALID [2020-07-10 19:05:20,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} assume 0 < #StackHeapBarrier; {2631#true} is VALID [2020-07-10 19:05:20,850 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} assume true; {2631#true} is VALID [2020-07-10 19:05:20,850 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2631#true} {2631#true} #147#return; {2631#true} is VALID [2020-07-10 19:05:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:20,936 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-10 19:05:20,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {2631#true} ~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2020-07-10 19:05:20,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} assume !!(~len > 0); {2631#true} is VALID [2020-07-10 19:05:20,938 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-10 19:05:20,939 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-10 19:05:20,939 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-10 19:05:20,940 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-10 19:05:20,941 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-10 19:05:20,941 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-10 19:05:20,942 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-10 19:05:20,943 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-10 19:05:20,943 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-10 19:05:20,944 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-10 19:05:20,945 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-10 19:05:20,946 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-10 19:05:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:20,991 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-10 19:05:20,992 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-10 19:05:20,993 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-10 19:05:20,994 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-10 19:05:20,994 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-10 19:05:20,996 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-10 19:05:20,997 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-10 19:05:20,998 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-10 19:05:20,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} #valid := #valid[0 := 0]; {2631#true} is VALID [2020-07-10 19:05:20,998 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} assume 0 < #StackHeapBarrier; {2631#true} is VALID [2020-07-10 19:05:20,999 INFO L280 TraceCheckUtils]: 4: Hoare triple {2631#true} assume true; {2631#true} is VALID [2020-07-10 19:05:20,999 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2631#true} {2631#true} #147#return; {2631#true} is VALID [2020-07-10 19:05:20,999 INFO L263 TraceCheckUtils]: 6: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2020-07-10 19:05:20,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {2631#true} ~len~1 := 2; {2631#true} is VALID [2020-07-10 19:05:21,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {2631#true} #t~short8 := ~len~1 < 32; {2631#true} is VALID [2020-07-10 19:05:21,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {2631#true} assume #t~short8; {2631#true} is VALID [2020-07-10 19:05:21,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {2631#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2631#true} is VALID [2020-07-10 19:05:21,000 INFO L280 TraceCheckUtils]: 11: Hoare triple {2631#true} #t~short8 := 0 != #t~nondet7; {2631#true} is VALID [2020-07-10 19:05:21,001 INFO L280 TraceCheckUtils]: 12: Hoare triple {2631#true} assume !#t~short8; {2631#true} is VALID [2020-07-10 19:05:21,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {2631#true} havoc #t~short8; {2631#true} is VALID [2020-07-10 19:05:21,001 INFO L280 TraceCheckUtils]: 14: Hoare triple {2631#true} havoc #t~nondet7; {2631#true} is VALID [2020-07-10 19:05:21,003 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-10 19:05:21,003 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-10 19:05:21,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {2631#true} ~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2020-07-10 19:05:21,004 INFO L280 TraceCheckUtils]: 18: Hoare triple {2631#true} assume !!(~len > 0); {2631#true} is VALID [2020-07-10 19:05:21,004 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-10 19:05:21,005 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-10 19:05:21,006 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-10 19:05:21,007 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-10 19:05:21,008 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-10 19:05:21,009 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-10 19:05:21,009 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-10 19:05:21,010 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-10 19:05:21,011 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-10 19:05:21,012 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-10 19:05:21,013 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-10 19:05:21,014 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-10 19:05:21,015 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-10 19:05:21,016 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-10 19:05:21,016 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-10 19:05:21,017 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-10 19:05:21,018 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-10 19:05:21,018 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-10 19:05:21,019 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-10 19:05:21,020 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-10 19:05:21,021 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-10 19:05:21,021 INFO L280 TraceCheckUtils]: 40: Hoare triple {2632#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {2632#false} is VALID [2020-07-10 19:05:21,022 INFO L280 TraceCheckUtils]: 41: Hoare triple {2632#false} assume ~len~1 != #t~ret11; {2632#false} is VALID [2020-07-10 19:05:21,022 INFO L280 TraceCheckUtils]: 42: Hoare triple {2632#false} havoc #t~ret11; {2632#false} is VALID [2020-07-10 19:05:21,022 INFO L280 TraceCheckUtils]: 43: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2020-07-10 19:05:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:21,025 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:21,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202833521] [2020-07-10 19:05:21,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:21,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 19:05:21,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942415064] [2020-07-10 19:05:21,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-10 19:05:21,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:21,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 19:05:21,075 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-10 19:05:21,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 19:05:21,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:21,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 19:05:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:05:21,077 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 12 states. [2020-07-10 19:05:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:22,942 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-07-10 19:05:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 19:05:22,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-10 19:05:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:05:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-10 19:05:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 19:05:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-10 19:05:22,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 91 transitions. [2020-07-10 19:05:23,091 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-10 19:05:23,094 INFO L225 Difference]: With dead ends: 101 [2020-07-10 19:05:23,094 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 19:05:23,095 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-10 19:05:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 19:05:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2020-07-10 19:05:23,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:23,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 81 states. [2020-07-10 19:05:23,309 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 81 states. [2020-07-10 19:05:23,309 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 81 states. [2020-07-10 19:05:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:23,313 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-10 19:05:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-10 19:05:23,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:23,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:23,314 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 96 states. [2020-07-10 19:05:23,314 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 96 states. [2020-07-10 19:05:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:23,319 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-10 19:05:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-10 19:05:23,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:23,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:23,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:23,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 19:05:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-10 19:05:23,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 44 [2020-07-10 19:05:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:23,324 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-10 19:05:23,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 19:05:23,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-10 19:05:23,488 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-10 19:05:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-10 19:05:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 19:05:23,490 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:23,490 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-10 19:05:23,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:05:23,491 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash -829611268, now seen corresponding path program 1 times [2020-07-10 19:05:23,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:23,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513597309] [2020-07-10 19:05:23,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:23,600 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-10 19:05:23,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {3243#true} #valid := #valid[0 := 0]; {3243#true} is VALID [2020-07-10 19:05:23,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} assume 0 < #StackHeapBarrier; {3243#true} is VALID [2020-07-10 19:05:23,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-10 19:05:23,601 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3243#true} {3243#true} #147#return; {3243#true} is VALID [2020-07-10 19:05:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:23,661 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-10 19:05:23,662 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-10 19:05:23,663 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-10 19:05:23,663 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-10 19:05:23,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {3268#(<= |sll_create_#in~len| 0)} assume true; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-10 19:05:23,665 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-10 19:05:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:23,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {3243#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3243#true} is VALID [2020-07-10 19:05:23,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {3243#true} ~len~0 := 0; {3243#true} is VALID [2020-07-10 19:05:23,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} assume !(~head.base != 0 || ~head.offset != 0); {3243#true} is VALID [2020-07-10 19:05:23,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} #res := ~len~0; {3243#true} is VALID [2020-07-10 19:05:23,673 INFO L280 TraceCheckUtils]: 4: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-10 19:05:23,673 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3243#true} {3244#false} #143#return; {3244#false} is VALID [2020-07-10 19:05:23,676 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-10 19:05:23,677 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-10 19:05:23,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} #valid := #valid[0 := 0]; {3243#true} is VALID [2020-07-10 19:05:23,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} assume 0 < #StackHeapBarrier; {3243#true} is VALID [2020-07-10 19:05:23,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-10 19:05:23,677 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3243#true} {3243#true} #147#return; {3243#true} is VALID [2020-07-10 19:05:23,678 INFO L263 TraceCheckUtils]: 6: Hoare triple {3243#true} call #t~ret12 := main(); {3243#true} is VALID [2020-07-10 19:05:23,679 INFO L280 TraceCheckUtils]: 7: Hoare triple {3243#true} ~len~1 := 2; {3250#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:23,679 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-10 19:05:23,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {3250#(<= 2 main_~len~1)} assume #t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:23,680 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-10 19:05:23,680 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-10 19:05:23,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {3250#(<= 2 main_~len~1)} assume !!#t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:23,681 INFO L280 TraceCheckUtils]: 13: Hoare triple {3250#(<= 2 main_~len~1)} havoc #t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:23,682 INFO L280 TraceCheckUtils]: 14: Hoare triple {3250#(<= 2 main_~len~1)} havoc #t~nondet7; {3250#(<= 2 main_~len~1)} is VALID [2020-07-10 19:05:23,682 INFO L280 TraceCheckUtils]: 15: Hoare triple {3250#(<= 2 main_~len~1)} #t~post9 := ~len~1; {3251#(<= 2 |main_#t~post9|)} is VALID [2020-07-10 19:05:23,683 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-10 19:05:23,683 INFO L280 TraceCheckUtils]: 17: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~post9; {3252#(<= 3 main_~len~1)} is VALID [2020-07-10 19:05:23,684 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-10 19:05:23,684 INFO L280 TraceCheckUtils]: 19: Hoare triple {3252#(<= 3 main_~len~1)} assume #t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-10 19:05:23,686 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-10 19:05:23,692 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-10 19:05:23,693 INFO L280 TraceCheckUtils]: 22: Hoare triple {3252#(<= 3 main_~len~1)} assume !#t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-10 19:05:23,693 INFO L280 TraceCheckUtils]: 23: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-10 19:05:23,694 INFO L280 TraceCheckUtils]: 24: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~nondet7; {3252#(<= 3 main_~len~1)} is VALID [2020-07-10 19:05:23,695 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-10 19:05:23,695 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-10 19:05:23,696 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-10 19:05:23,696 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-10 19:05:23,697 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-10 19:05:23,697 INFO L280 TraceCheckUtils]: 30: Hoare triple {3268#(<= |sll_create_#in~len| 0)} assume true; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-10 19:05:23,703 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-10 19:05:23,703 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-10 19:05:23,703 INFO L280 TraceCheckUtils]: 33: Hoare triple {3244#false} havoc #t~ret10.base, #t~ret10.offset; {3244#false} is VALID [2020-07-10 19:05:23,703 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-10 19:05:23,704 INFO L280 TraceCheckUtils]: 35: Hoare triple {3243#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3243#true} is VALID [2020-07-10 19:05:23,704 INFO L280 TraceCheckUtils]: 36: Hoare triple {3243#true} ~len~0 := 0; {3243#true} is VALID [2020-07-10 19:05:23,704 INFO L280 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !(~head.base != 0 || ~head.offset != 0); {3243#true} is VALID [2020-07-10 19:05:23,704 INFO L280 TraceCheckUtils]: 38: Hoare triple {3243#true} #res := ~len~0; {3243#true} is VALID [2020-07-10 19:05:23,704 INFO L280 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-10 19:05:23,705 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3243#true} {3244#false} #143#return; {3244#false} is VALID [2020-07-10 19:05:23,705 INFO L280 TraceCheckUtils]: 41: Hoare triple {3244#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {3244#false} is VALID [2020-07-10 19:05:23,705 INFO L280 TraceCheckUtils]: 42: Hoare triple {3244#false} assume ~len~1 != #t~ret11; {3244#false} is VALID [2020-07-10 19:05:23,705 INFO L280 TraceCheckUtils]: 43: Hoare triple {3244#false} havoc #t~ret11; {3244#false} is VALID [2020-07-10 19:05:23,705 INFO L280 TraceCheckUtils]: 44: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2020-07-10 19:05:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:23,708 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:23,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513597309] [2020-07-10 19:05:23,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:23,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 19:05:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469796912] [2020-07-10 19:05:23,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-10 19:05:23,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:23,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 19:05:23,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:23,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 19:05:23,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:23,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 19:05:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:05:23,754 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2020-07-10 19:05:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:25,051 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2020-07-10 19:05:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 19:05:25,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-10 19:05:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:05:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-10 19:05:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:05:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-10 19:05:25,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2020-07-10 19:05:25,242 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-10 19:05:25,246 INFO L225 Difference]: With dead ends: 117 [2020-07-10 19:05:25,246 INFO L226 Difference]: Without dead ends: 87 [2020-07-10 19:05:25,247 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-10 19:05:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-10 19:05:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2020-07-10 19:05:25,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:25,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 69 states. [2020-07-10 19:05:25,467 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 69 states. [2020-07-10 19:05:25,467 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 69 states. [2020-07-10 19:05:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:25,471 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-07-10 19:05:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2020-07-10 19:05:25,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:25,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:25,472 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 87 states. [2020-07-10 19:05:25,472 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 87 states. [2020-07-10 19:05:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:25,477 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-07-10 19:05:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2020-07-10 19:05:25,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:25,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:25,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:25,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-10 19:05:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-07-10 19:05:25,495 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 45 [2020-07-10 19:05:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:25,496 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-07-10 19:05:25,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 19:05:25,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2020-07-10 19:05:25,653 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-10 19:05:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-10 19:05:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 19:05:25,655 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:25,655 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-10 19:05:25,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:05:25,656 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:25,658 INFO L82 PathProgramCache]: Analyzing trace with hash -642872939, now seen corresponding path program 1 times [2020-07-10 19:05:25,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:25,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [489722581] [2020-07-10 19:05:25,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:25,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:05:25,681 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 19:05:25,691 INFO L168 Benchmark]: Toolchain (without parser) took 14641.91 ms. Allocated memory was 140.5 MB in the beginning and 392.2 MB in the end (delta: 251.7 MB). Free memory was 102.6 MB in the beginning and 330.5 MB in the end (delta: -227.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:25,692 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:05:25,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.69 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 102.4 MB in the beginning and 169.2 MB in the end (delta: -66.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:25,703 INFO L168 Benchmark]: Boogie Preprocessor took 110.07 ms. Allocated memory is still 203.4 MB. Free memory was 169.2 MB in the beginning and 165.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:25,705 INFO L168 Benchmark]: RCFGBuilder took 832.90 ms. Allocated memory is still 203.4 MB. Free memory was 165.5 MB in the beginning and 108.1 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:25,706 INFO L168 Benchmark]: TraceAbstraction took 12948.88 ms. Allocated memory was 203.4 MB in the beginning and 392.2 MB in the end (delta: 188.7 MB). Free memory was 107.4 MB in the beginning and 330.5 MB in the end (delta: -223.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:05:25,715 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.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.69 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 102.4 MB in the beginning and 169.2 MB in the end (delta: -66.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.07 ms. Allocated memory is still 203.4 MB. Free memory was 169.2 MB in the beginning and 165.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.90 ms. Allocated memory is still 203.4 MB. Free memory was 165.5 MB in the beginning and 108.1 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12948.88 ms. Allocated memory was 203.4 MB in the beginning and 392.2 MB in the end (delta: 188.7 MB). Free memory was 107.4 MB in the beginning and 330.5 MB in the end (delta: -223.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...