/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:28:02,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:28:02,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:28:02,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:28:02,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:28:02,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:28:02,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:28:02,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:28:02,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:28:02,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:28:02,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:28:02,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:28:02,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:28:02,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:28:02,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:28:02,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:28:02,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:28:02,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:28:02,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:28:02,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:28:02,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:28:02,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:28:02,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:28:02,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:28:02,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:28:02,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:28:02,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:28:02,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:28:02,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:28:02,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:28:02,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:28:02,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:28:02,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:28:02,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:28:02,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:28:02,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:28:02,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:28:02,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:28:02,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:28:02,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:28:02,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:28:02,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:28:02,565 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:28:02,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:28:02,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:28:02,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:28:02,569 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:28:02,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:28:02,570 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:28:02,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:28:02,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:28:02,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:28:02,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:28:02,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:28:02,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:28:02,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:28:02,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:28:02,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:28:02,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:28:02,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:28:02,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:28:02,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:28:02,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:28:02,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:28:02,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:28:02,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:28:02,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:28:02,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:28:02,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:28:02,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:28:02,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:28:02,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:28:02,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:28:02,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:28:02,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:28:02,908 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:28:02,909 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:28:02,910 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.i [2020-07-08 12:28:02,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d4223c4/f50ae1105e0846259c951c45033322ca/FLAG1c65b6b62 [2020-07-08 12:28:03,530 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:28:03,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_reverse.i [2020-07-08 12:28:03,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d4223c4/f50ae1105e0846259c951c45033322ca/FLAG1c65b6b62 [2020-07-08 12:28:03,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d4223c4/f50ae1105e0846259c951c45033322ca [2020-07-08 12:28:03,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:28:03,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:28:03,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:28:03,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:28:03,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:28:03,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:28:03" (1/1) ... [2020-07-08 12:28:03,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474b24ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:03, skipping insertion in model container [2020-07-08 12:28:03,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:28:03" (1/1) ... [2020-07-08 12:28:03,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:28:03,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:28:04,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:28:04,494 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:28:04,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:28:04,611 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:28:04,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04 WrapperNode [2020-07-08 12:28:04,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:28:04,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:28:04,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:28:04,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:28:04,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (1/1) ... [2020-07-08 12:28:04,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:28:04,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:28:04,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:28:04,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:28:04,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (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-08 12:28:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:28:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:28:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-08 12:28:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-08 12:28:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-08 12:28:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-08 12:28:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-08 12:28:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2020-07-08 12:28:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2020-07-08 12:28:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2020-07-08 12:28:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:28:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:28:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-08 12:28:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-08 12:28:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 12:28:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 12:28:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 12:28:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 12:28:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 12:28:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 12:28:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 12:28:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 12:28:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 12:28:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 12:28:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 12:28:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 12:28:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 12:28:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 12:28:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 12:28:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 12:28:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 12:28:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 12:28:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 12:28:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 12:28:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 12:28:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 12:28:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 12:28:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 12:28:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 12:28:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 12:28:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 12:28:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 12:28:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 12:28:04,784 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 12:28:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 12:28:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 12:28:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 12:28:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:28:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 12:28:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 12:28:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 12:28:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 12:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 12:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 12:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 12:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 12:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 12:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 12:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 12:28:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 12:28:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-08 12:28:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-08 12:28:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:28:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:28:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:28:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-08 12:28:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2020-07-08 12:28:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:28:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:28:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2020-07-08 12:28:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:28:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2020-07-08 12:28:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:28:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:28:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:28:05,224 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-08 12:28:05,571 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:28:05,571 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 12:28:05,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:28:05 BoogieIcfgContainer [2020-07-08 12:28:05,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:28:05,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:28:05,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:28:05,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:28:05,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:28:03" (1/3) ... [2020-07-08 12:28:05,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220b51ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:28:05, skipping insertion in model container [2020-07-08 12:28:05,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:28:04" (2/3) ... [2020-07-08 12:28:05,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220b51ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:28:05, skipping insertion in model container [2020-07-08 12:28:05,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:28:05" (3/3) ... [2020-07-08 12:28:05,584 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2020-07-08 12:28:05,596 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:28:05,604 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:28:05,619 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:28:05,644 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:28:05,644 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:28:05,644 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:28:05,645 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:28:05,645 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:28:05,645 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:28:05,645 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:28:05,645 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:28:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-07-08 12:28:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:28:05,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:05,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:28:05,690 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1303429635, now seen corresponding path program 1 times [2020-07-08 12:28:05,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:05,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291710361] [2020-07-08 12:28:05,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:05,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {54#true} is VALID [2020-07-08 12:28:05,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-08 12:28:05,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #154#return; {54#true} is VALID [2020-07-08 12:28:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:05,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {54#true} is VALID [2020-07-08 12:28:05,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume !(~len > 0); {54#true} is VALID [2020-07-08 12:28:05,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {54#true} is VALID [2020-07-08 12:28:05,967 INFO L280 TraceCheckUtils]: 3: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-08 12:28:05,968 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {54#true} {54#true} #144#return; {54#true} is VALID [2020-07-08 12:28:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:05,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {54#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {54#true} is VALID [2020-07-08 12:28:05,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume !true; {55#false} is VALID [2020-07-08 12:28:05,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {55#false} is VALID [2020-07-08 12:28:05,979 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#false} assume true; {55#false} is VALID [2020-07-08 12:28:05,980 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {55#false} {54#true} #148#return; {55#false} is VALID [2020-07-08 12:28:05,982 INFO L263 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {69#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:05,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {54#true} is VALID [2020-07-08 12:28:05,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-08 12:28:05,983 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #154#return; {54#true} is VALID [2020-07-08 12:28:05,983 INFO L263 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret15 := main(); {54#true} is VALID [2020-07-08 12:28:05,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {54#true} ~len~0 := 2;~data~0 := 1; {54#true} is VALID [2020-07-08 12:28:05,986 INFO L263 TraceCheckUtils]: 6: Hoare triple {54#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {70#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:05,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {70#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {54#true} is VALID [2020-07-08 12:28:05,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {54#true} assume !(~len > 0); {54#true} is VALID [2020-07-08 12:28:05,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {54#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {54#true} is VALID [2020-07-08 12:28:05,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-08 12:28:05,988 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {54#true} {54#true} #144#return; {54#true} is VALID [2020-07-08 12:28:05,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {54#true} is VALID [2020-07-08 12:28:05,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#true} assume !(~i~0 >= 0); {54#true} is VALID [2020-07-08 12:28:05,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#true} ~i~0 := ~len~0 - 1; {54#true} is VALID [2020-07-08 12:28:05,989 INFO L280 TraceCheckUtils]: 15: Hoare triple {54#true} assume !!(~i~0 <= 0);~expected~0 := ~i~0 + ~len~0; {54#true} is VALID [2020-07-08 12:28:05,989 INFO L263 TraceCheckUtils]: 16: Hoare triple {54#true} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {54#true} is VALID [2020-07-08 12:28:05,990 INFO L280 TraceCheckUtils]: 17: Hoare triple {54#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {54#true} is VALID [2020-07-08 12:28:05,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {54#true} assume !true; {55#false} is VALID [2020-07-08 12:28:05,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {55#false} is VALID [2020-07-08 12:28:05,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#false} assume true; {55#false} is VALID [2020-07-08 12:28:05,992 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {55#false} {54#true} #148#return; {55#false} is VALID [2020-07-08 12:28:05,992 INFO L280 TraceCheckUtils]: 22: Hoare triple {55#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {55#false} is VALID [2020-07-08 12:28:05,993 INFO L280 TraceCheckUtils]: 23: Hoare triple {55#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {55#false} is VALID [2020-07-08 12:28:05,993 INFO L280 TraceCheckUtils]: 24: Hoare triple {55#false} assume !false; {55#false} is VALID [2020-07-08 12:28:05,997 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-08 12:28:05,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291710361] [2020-07-08 12:28:05,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:28:06,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:28:06,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761449743] [2020-07-08 12:28:06,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-08 12:28:06,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:06,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:28:06,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:06,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:28:06,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:06,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:28:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:28:06,072 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 4 states. [2020-07-08 12:28:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:06,840 INFO L93 Difference]: Finished difference Result 123 states and 178 transitions. [2020-07-08 12:28:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:28:06,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-08 12:28:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:28:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2020-07-08 12:28:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:28:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2020-07-08 12:28:06,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2020-07-08 12:28:07,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:07,164 INFO L225 Difference]: With dead ends: 123 [2020-07-08 12:28:07,165 INFO L226 Difference]: Without dead ends: 64 [2020-07-08 12:28:07,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-08 12:28:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-08 12:28:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2020-07-08 12:28:07,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:07,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 38 states. [2020-07-08 12:28:07,236 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 38 states. [2020-07-08 12:28:07,237 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 38 states. [2020-07-08 12:28:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:07,245 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2020-07-08 12:28:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-08 12:28:07,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:07,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:07,247 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 64 states. [2020-07-08 12:28:07,247 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 64 states. [2020-07-08 12:28:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:07,254 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2020-07-08 12:28:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-08 12:28:07,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:07,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:07,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:07,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 12:28:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-08 12:28:07,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2020-07-08 12:28:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:07,263 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-08 12:28:07,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:28:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-08 12:28:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:28:07,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:07,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:28:07,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:28:07,265 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2048382207, now seen corresponding path program 1 times [2020-07-08 12:28:07,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:07,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040148073] [2020-07-08 12:28:07,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:07,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {429#true} is VALID [2020-07-08 12:28:07,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {429#true} assume true; {429#true} is VALID [2020-07-08 12:28:07,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {429#true} {429#true} #154#return; {429#true} is VALID [2020-07-08 12:28:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:07,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {446#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {447#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:07,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {447#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {448#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:28:07,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {448#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:28:07,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {448#(<= |dll_create_#in~len| 0)} assume true; {448#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:28:07,431 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {448#(<= |dll_create_#in~len| 0)} {434#(<= 2 main_~len~0)} #144#return; {430#false} is VALID [2020-07-08 12:28:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:07,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {429#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {429#true} is VALID [2020-07-08 12:28:07,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {429#true} assume !(~index > 0); {429#true} is VALID [2020-07-08 12:28:07,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {429#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {429#true} is VALID [2020-07-08 12:28:07,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {429#true} assume true; {429#true} is VALID [2020-07-08 12:28:07,448 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {429#true} {430#false} #148#return; {430#false} is VALID [2020-07-08 12:28:07,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {445#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:07,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {429#true} is VALID [2020-07-08 12:28:07,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2020-07-08 12:28:07,457 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #154#return; {429#true} is VALID [2020-07-08 12:28:07,457 INFO L263 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret15 := main(); {429#true} is VALID [2020-07-08 12:28:07,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {429#true} ~len~0 := 2;~data~0 := 1; {434#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:07,459 INFO L263 TraceCheckUtils]: 6: Hoare triple {434#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {446#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:07,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {446#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {447#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:07,461 INFO L280 TraceCheckUtils]: 8: Hoare triple {447#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {448#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:28:07,462 INFO L280 TraceCheckUtils]: 9: Hoare triple {448#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:28:07,462 INFO L280 TraceCheckUtils]: 10: Hoare triple {448#(<= |dll_create_#in~len| 0)} assume true; {448#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:28:07,465 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {448#(<= |dll_create_#in~len| 0)} {434#(<= 2 main_~len~0)} #144#return; {430#false} is VALID [2020-07-08 12:28:07,466 INFO L280 TraceCheckUtils]: 12: Hoare triple {430#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {430#false} is VALID [2020-07-08 12:28:07,466 INFO L280 TraceCheckUtils]: 13: Hoare triple {430#false} assume !(~i~0 >= 0); {430#false} is VALID [2020-07-08 12:28:07,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {430#false} ~i~0 := ~len~0 - 1; {430#false} is VALID [2020-07-08 12:28:07,467 INFO L280 TraceCheckUtils]: 15: Hoare triple {430#false} assume !!(~i~0 <= 0);~expected~0 := ~i~0 + ~len~0; {430#false} is VALID [2020-07-08 12:28:07,467 INFO L263 TraceCheckUtils]: 16: Hoare triple {430#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {429#true} is VALID [2020-07-08 12:28:07,467 INFO L280 TraceCheckUtils]: 17: Hoare triple {429#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {429#true} is VALID [2020-07-08 12:28:07,468 INFO L280 TraceCheckUtils]: 18: Hoare triple {429#true} assume !(~index > 0); {429#true} is VALID [2020-07-08 12:28:07,468 INFO L280 TraceCheckUtils]: 19: Hoare triple {429#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {429#true} is VALID [2020-07-08 12:28:07,468 INFO L280 TraceCheckUtils]: 20: Hoare triple {429#true} assume true; {429#true} is VALID [2020-07-08 12:28:07,469 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {429#true} {430#false} #148#return; {430#false} is VALID [2020-07-08 12:28:07,469 INFO L280 TraceCheckUtils]: 22: Hoare triple {430#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {430#false} is VALID [2020-07-08 12:28:07,469 INFO L280 TraceCheckUtils]: 23: Hoare triple {430#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {430#false} is VALID [2020-07-08 12:28:07,470 INFO L280 TraceCheckUtils]: 24: Hoare triple {430#false} assume !false; {430#false} is VALID [2020-07-08 12:28:07,472 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-08 12:28:07,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040148073] [2020-07-08 12:28:07,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:28:07,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:28:07,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772732358] [2020-07-08 12:28:07,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-08 12:28:07,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:07,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:28:07,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:07,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:28:07,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:28:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:28:07,513 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2020-07-08 12:28:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:08,165 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2020-07-08 12:28:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:28:08,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-08 12:28:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:28:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2020-07-08 12:28:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:28:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2020-07-08 12:28:08,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 78 transitions. [2020-07-08 12:28:08,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:08,279 INFO L225 Difference]: With dead ends: 68 [2020-07-08 12:28:08,279 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 12:28:08,280 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-08 12:28:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 12:28:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-07-08 12:28:08,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:08,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2020-07-08 12:28:08,311 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2020-07-08 12:28:08,312 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2020-07-08 12:28:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:08,315 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-08 12:28:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 12:28:08,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:08,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:08,316 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2020-07-08 12:28:08,316 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2020-07-08 12:28:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:08,319 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-08 12:28:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 12:28:08,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:08,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:08,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:08,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 12:28:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-07-08 12:28:08,323 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2020-07-08 12:28:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:08,323 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-07-08 12:28:08,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:28:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:28:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:28:08,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:08,325 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] [2020-07-08 12:28:08,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:28:08,325 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1036290808, now seen corresponding path program 1 times [2020-07-08 12:28:08,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:08,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599031283] [2020-07-08 12:28:08,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:08,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {696#true} is VALID [2020-07-08 12:28:08,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {696#true} assume true; {696#true} is VALID [2020-07-08 12:28:08,438 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {696#true} {696#true} #154#return; {696#true} is VALID [2020-07-08 12:28:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:08,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {718#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {697#false} is VALID [2020-07-08 12:28:08,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {697#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {697#false} is VALID [2020-07-08 12:28:08,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {697#false} assume !(~len > 0); {697#false} is VALID [2020-07-08 12:28:08,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {697#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {697#false} is VALID [2020-07-08 12:28:08,538 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#false} assume true; {697#false} is VALID [2020-07-08 12:28:08,539 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {697#false} {701#(<= 2 main_~len~0)} #144#return; {697#false} is VALID [2020-07-08 12:28:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:08,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {696#true} is VALID [2020-07-08 12:28:08,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {696#true} assume !(~index > 0); {696#true} is VALID [2020-07-08 12:28:08,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {696#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {696#true} is VALID [2020-07-08 12:28:08,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {696#true} assume true; {696#true} is VALID [2020-07-08 12:28:08,547 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {696#true} {697#false} #148#return; {697#false} is VALID [2020-07-08 12:28:08,548 INFO L263 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:08,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {696#true} is VALID [2020-07-08 12:28:08,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2020-07-08 12:28:08,549 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #154#return; {696#true} is VALID [2020-07-08 12:28:08,549 INFO L263 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret15 := main(); {696#true} is VALID [2020-07-08 12:28:08,550 INFO L280 TraceCheckUtils]: 5: Hoare triple {696#true} ~len~0 := 2;~data~0 := 1; {701#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:08,552 INFO L263 TraceCheckUtils]: 6: Hoare triple {701#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {718#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:08,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {718#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,555 INFO L280 TraceCheckUtils]: 8: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:08,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {719#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {697#false} is VALID [2020-07-08 12:28:08,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {697#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {697#false} is VALID [2020-07-08 12:28:08,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {697#false} assume !(~len > 0); {697#false} is VALID [2020-07-08 12:28:08,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {697#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {697#false} is VALID [2020-07-08 12:28:08,561 INFO L280 TraceCheckUtils]: 15: Hoare triple {697#false} assume true; {697#false} is VALID [2020-07-08 12:28:08,561 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {697#false} {701#(<= 2 main_~len~0)} #144#return; {697#false} is VALID [2020-07-08 12:28:08,562 INFO L280 TraceCheckUtils]: 17: Hoare triple {697#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {697#false} is VALID [2020-07-08 12:28:08,562 INFO L280 TraceCheckUtils]: 18: Hoare triple {697#false} assume !(~i~0 >= 0); {697#false} is VALID [2020-07-08 12:28:08,562 INFO L280 TraceCheckUtils]: 19: Hoare triple {697#false} ~i~0 := ~len~0 - 1; {697#false} is VALID [2020-07-08 12:28:08,562 INFO L280 TraceCheckUtils]: 20: Hoare triple {697#false} assume !!(~i~0 <= 0);~expected~0 := ~i~0 + ~len~0; {697#false} is VALID [2020-07-08 12:28:08,563 INFO L263 TraceCheckUtils]: 21: Hoare triple {697#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {696#true} is VALID [2020-07-08 12:28:08,563 INFO L280 TraceCheckUtils]: 22: Hoare triple {696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {696#true} is VALID [2020-07-08 12:28:08,563 INFO L280 TraceCheckUtils]: 23: Hoare triple {696#true} assume !(~index > 0); {696#true} is VALID [2020-07-08 12:28:08,563 INFO L280 TraceCheckUtils]: 24: Hoare triple {696#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {696#true} is VALID [2020-07-08 12:28:08,564 INFO L280 TraceCheckUtils]: 25: Hoare triple {696#true} assume true; {696#true} is VALID [2020-07-08 12:28:08,564 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {696#true} {697#false} #148#return; {697#false} is VALID [2020-07-08 12:28:08,564 INFO L280 TraceCheckUtils]: 27: Hoare triple {697#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {697#false} is VALID [2020-07-08 12:28:08,564 INFO L280 TraceCheckUtils]: 28: Hoare triple {697#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {697#false} is VALID [2020-07-08 12:28:08,565 INFO L280 TraceCheckUtils]: 29: Hoare triple {697#false} assume !false; {697#false} is VALID [2020-07-08 12:28:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:28:08,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599031283] [2020-07-08 12:28:08,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:28:08,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:28:08,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058929523] [2020-07-08 12:28:08,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-08 12:28:08,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:08,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:28:08,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:08,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:28:08,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:28:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:28:08,622 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 6 states. [2020-07-08 12:28:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:09,124 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-08 12:28:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:28:09,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-08 12:28:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:28:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2020-07-08 12:28:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:28:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2020-07-08 12:28:09,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2020-07-08 12:28:09,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:09,246 INFO L225 Difference]: With dead ends: 73 [2020-07-08 12:28:09,246 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 12:28:09,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:28:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 12:28:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-08 12:28:09,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:09,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-08 12:28:09,282 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-08 12:28:09,282 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-08 12:28:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:09,286 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-08 12:28:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 12:28:09,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:09,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:09,287 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-08 12:28:09,287 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-08 12:28:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:09,290 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-08 12:28:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 12:28:09,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:09,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:09,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:09,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:28:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-08 12:28:09,293 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2020-07-08 12:28:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:09,294 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-08 12:28:09,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:28:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 12:28:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:28:09,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:09,295 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] [2020-07-08 12:28:09,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:28:09,295 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1569732746, now seen corresponding path program 1 times [2020-07-08 12:28:09,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:09,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45143550] [2020-07-08 12:28:09,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:09,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {974#true} is VALID [2020-07-08 12:28:09,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-08 12:28:09,360 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {974#true} {974#true} #154#return; {974#true} is VALID [2020-07-08 12:28:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:09,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {996#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,433 INFO L280 TraceCheckUtils]: 3: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,433 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,434 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {998#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-08 12:28:09,434 INFO L280 TraceCheckUtils]: 6: Hoare triple {998#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,435 INFO L280 TraceCheckUtils]: 7: Hoare triple {999#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,435 INFO L280 TraceCheckUtils]: 8: Hoare triple {999#(<= |dll_create_#in~len| 1)} assume true; {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,437 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {999#(<= |dll_create_#in~len| 1)} {979#(<= 2 main_~len~0)} #144#return; {975#false} is VALID [2020-07-08 12:28:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:09,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {974#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {974#true} is VALID [2020-07-08 12:28:09,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#true} assume !(~index > 0); {974#true} is VALID [2020-07-08 12:28:09,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {974#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {974#true} is VALID [2020-07-08 12:28:09,449 INFO L280 TraceCheckUtils]: 3: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-08 12:28:09,449 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {974#true} {975#false} #148#return; {975#false} is VALID [2020-07-08 12:28:09,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {995#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:09,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {974#true} is VALID [2020-07-08 12:28:09,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-08 12:28:09,450 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #154#return; {974#true} is VALID [2020-07-08 12:28:09,450 INFO L263 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret15 := main(); {974#true} is VALID [2020-07-08 12:28:09,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {974#true} ~len~0 := 2;~data~0 := 1; {979#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:09,455 INFO L263 TraceCheckUtils]: 6: Hoare triple {979#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {996#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:09,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {996#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,464 INFO L280 TraceCheckUtils]: 11: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {997#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:09,465 INFO L280 TraceCheckUtils]: 12: Hoare triple {997#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {998#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-08 12:28:09,466 INFO L280 TraceCheckUtils]: 13: Hoare triple {998#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {999#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,467 INFO L280 TraceCheckUtils]: 15: Hoare triple {999#(<= |dll_create_#in~len| 1)} assume true; {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,469 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {999#(<= |dll_create_#in~len| 1)} {979#(<= 2 main_~len~0)} #144#return; {975#false} is VALID [2020-07-08 12:28:09,469 INFO L280 TraceCheckUtils]: 17: Hoare triple {975#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {975#false} is VALID [2020-07-08 12:28:09,470 INFO L280 TraceCheckUtils]: 18: Hoare triple {975#false} assume !(~i~0 >= 0); {975#false} is VALID [2020-07-08 12:28:09,470 INFO L280 TraceCheckUtils]: 19: Hoare triple {975#false} ~i~0 := ~len~0 - 1; {975#false} is VALID [2020-07-08 12:28:09,470 INFO L280 TraceCheckUtils]: 20: Hoare triple {975#false} assume !!(~i~0 <= 0);~expected~0 := ~i~0 + ~len~0; {975#false} is VALID [2020-07-08 12:28:09,471 INFO L263 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {974#true} is VALID [2020-07-08 12:28:09,471 INFO L280 TraceCheckUtils]: 22: Hoare triple {974#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {974#true} is VALID [2020-07-08 12:28:09,471 INFO L280 TraceCheckUtils]: 23: Hoare triple {974#true} assume !(~index > 0); {974#true} is VALID [2020-07-08 12:28:09,471 INFO L280 TraceCheckUtils]: 24: Hoare triple {974#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {974#true} is VALID [2020-07-08 12:28:09,472 INFO L280 TraceCheckUtils]: 25: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-08 12:28:09,472 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {974#true} {975#false} #148#return; {975#false} is VALID [2020-07-08 12:28:09,472 INFO L280 TraceCheckUtils]: 27: Hoare triple {975#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {975#false} is VALID [2020-07-08 12:28:09,473 INFO L280 TraceCheckUtils]: 28: Hoare triple {975#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {975#false} is VALID [2020-07-08 12:28:09,473 INFO L280 TraceCheckUtils]: 29: Hoare triple {975#false} assume !false; {975#false} is VALID [2020-07-08 12:28:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:28:09,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45143550] [2020-07-08 12:28:09,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232890486] [2020-07-08 12:28:09,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:09,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:28:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:09,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:28:09,727 INFO L263 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2020-07-08 12:28:09,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {974#true} is VALID [2020-07-08 12:28:09,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-08 12:28:09,728 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #154#return; {974#true} is VALID [2020-07-08 12:28:09,729 INFO L263 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret15 := main(); {974#true} is VALID [2020-07-08 12:28:09,729 INFO L280 TraceCheckUtils]: 5: Hoare triple {974#true} ~len~0 := 2;~data~0 := 1; {979#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:09,730 INFO L263 TraceCheckUtils]: 6: Hoare triple {979#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {974#true} is VALID [2020-07-08 12:28:09,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {974#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1024#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:28:09,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {1024#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1024#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:28:09,732 INFO L280 TraceCheckUtils]: 9: Hoare triple {1024#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1024#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:28:09,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {1024#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1024#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:28:09,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {1024#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1024#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:28:09,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {1024#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {998#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-08 12:28:09,735 INFO L280 TraceCheckUtils]: 13: Hoare triple {998#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {999#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,736 INFO L280 TraceCheckUtils]: 15: Hoare triple {999#(<= |dll_create_#in~len| 1)} assume true; {999#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:28:09,737 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {999#(<= |dll_create_#in~len| 1)} {979#(<= 2 main_~len~0)} #144#return; {975#false} is VALID [2020-07-08 12:28:09,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {975#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {975#false} is VALID [2020-07-08 12:28:09,738 INFO L280 TraceCheckUtils]: 18: Hoare triple {975#false} assume !(~i~0 >= 0); {975#false} is VALID [2020-07-08 12:28:09,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {975#false} ~i~0 := ~len~0 - 1; {975#false} is VALID [2020-07-08 12:28:09,738 INFO L280 TraceCheckUtils]: 20: Hoare triple {975#false} assume !!(~i~0 <= 0);~expected~0 := ~i~0 + ~len~0; {975#false} is VALID [2020-07-08 12:28:09,739 INFO L263 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {975#false} is VALID [2020-07-08 12:28:09,739 INFO L280 TraceCheckUtils]: 22: Hoare triple {975#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {975#false} is VALID [2020-07-08 12:28:09,739 INFO L280 TraceCheckUtils]: 23: Hoare triple {975#false} assume !(~index > 0); {975#false} is VALID [2020-07-08 12:28:09,739 INFO L280 TraceCheckUtils]: 24: Hoare triple {975#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {975#false} is VALID [2020-07-08 12:28:09,740 INFO L280 TraceCheckUtils]: 25: Hoare triple {975#false} assume true; {975#false} is VALID [2020-07-08 12:28:09,740 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {975#false} {975#false} #148#return; {975#false} is VALID [2020-07-08 12:28:09,740 INFO L280 TraceCheckUtils]: 27: Hoare triple {975#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {975#false} is VALID [2020-07-08 12:28:09,740 INFO L280 TraceCheckUtils]: 28: Hoare triple {975#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {975#false} is VALID [2020-07-08 12:28:09,741 INFO L280 TraceCheckUtils]: 29: Hoare triple {975#false} assume !false; {975#false} is VALID [2020-07-08 12:28:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:28:09,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:28:09,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-08 12:28:09,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727746150] [2020-07-08 12:28:09,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-08 12:28:09,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:09,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:28:09,798 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-08 12:28:09,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:28:09,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:28:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:28:09,800 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2020-07-08 12:28:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:10,446 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-08 12:28:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:28:10,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-08 12:28:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:28:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-08 12:28:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:28:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-08 12:28:10,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2020-07-08 12:28:10,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:10,604 INFO L225 Difference]: With dead ends: 73 [2020-07-08 12:28:10,605 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:28:10,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:28:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:28:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-08 12:28:10,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:10,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-08 12:28:10,642 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-08 12:28:10,642 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-08 12:28:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:10,645 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 12:28:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-08 12:28:10,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:10,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:10,647 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-08 12:28:10,647 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-08 12:28:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:10,649 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 12:28:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-08 12:28:10,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:10,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:10,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:10,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 12:28:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2020-07-08 12:28:10,652 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2020-07-08 12:28:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:10,652 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2020-07-08 12:28:10,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:28:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2020-07-08 12:28:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 12:28:10,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:10,654 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] [2020-07-08 12:28:10,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:10,869 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 649760861, now seen corresponding path program 1 times [2020-07-08 12:28:10,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:10,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518115322] [2020-07-08 12:28:10,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:10,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1357#true} is VALID [2020-07-08 12:28:10,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-08 12:28:10,965 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1357#true} {1357#true} #154#return; {1357#true} is VALID [2020-07-08 12:28:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:11,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {1385#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2020-07-08 12:28:11,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1357#true} is VALID [2020-07-08 12:28:11,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-08 12:28:11,029 INFO L280 TraceCheckUtils]: 3: Hoare triple {1357#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1357#true} is VALID [2020-07-08 12:28:11,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {1357#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1357#true} is VALID [2020-07-08 12:28:11,029 INFO L280 TraceCheckUtils]: 5: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1357#true} is VALID [2020-07-08 12:28:11,029 INFO L280 TraceCheckUtils]: 6: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1357#true} is VALID [2020-07-08 12:28:11,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-08 12:28:11,030 INFO L280 TraceCheckUtils]: 8: Hoare triple {1357#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1357#true} is VALID [2020-07-08 12:28:11,030 INFO L280 TraceCheckUtils]: 9: Hoare triple {1357#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1357#true} is VALID [2020-07-08 12:28:11,030 INFO L280 TraceCheckUtils]: 10: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1357#true} is VALID [2020-07-08 12:28:11,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {1357#true} assume !(~len > 0); {1357#true} is VALID [2020-07-08 12:28:11,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {1357#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1357#true} is VALID [2020-07-08 12:28:11,031 INFO L280 TraceCheckUtils]: 13: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-08 12:28:11,032 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1357#true} {1362#(<= 2 main_~len~0)} #144#return; {1362#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:11,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {1357#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1357#true} is VALID [2020-07-08 12:28:11,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {1357#true} assume !(~index > 0); {1357#true} is VALID [2020-07-08 12:28:11,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {1357#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1357#true} is VALID [2020-07-08 12:28:11,040 INFO L280 TraceCheckUtils]: 3: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-08 12:28:11,040 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1357#true} {1358#false} #148#return; {1358#false} is VALID [2020-07-08 12:28:11,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {1357#true} call ULTIMATE.init(); {1384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:11,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {1384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1357#true} is VALID [2020-07-08 12:28:11,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-08 12:28:11,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1357#true} {1357#true} #154#return; {1357#true} is VALID [2020-07-08 12:28:11,042 INFO L263 TraceCheckUtils]: 4: Hoare triple {1357#true} call #t~ret15 := main(); {1357#true} is VALID [2020-07-08 12:28:11,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {1357#true} ~len~0 := 2;~data~0 := 1; {1362#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:11,044 INFO L263 TraceCheckUtils]: 6: Hoare triple {1362#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1385#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:11,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {1385#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2020-07-08 12:28:11,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1357#true} is VALID [2020-07-08 12:28:11,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-08 12:28:11,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {1357#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1357#true} is VALID [2020-07-08 12:28:11,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {1357#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1357#true} is VALID [2020-07-08 12:28:11,046 INFO L280 TraceCheckUtils]: 12: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1357#true} is VALID [2020-07-08 12:28:11,046 INFO L280 TraceCheckUtils]: 13: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1357#true} is VALID [2020-07-08 12:28:11,046 INFO L280 TraceCheckUtils]: 14: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-08 12:28:11,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {1357#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1357#true} is VALID [2020-07-08 12:28:11,047 INFO L280 TraceCheckUtils]: 16: Hoare triple {1357#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1357#true} is VALID [2020-07-08 12:28:11,047 INFO L280 TraceCheckUtils]: 17: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1357#true} is VALID [2020-07-08 12:28:11,047 INFO L280 TraceCheckUtils]: 18: Hoare triple {1357#true} assume !(~len > 0); {1357#true} is VALID [2020-07-08 12:28:11,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {1357#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1357#true} is VALID [2020-07-08 12:28:11,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-08 12:28:11,049 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1357#true} {1362#(<= 2 main_~len~0)} #144#return; {1362#(<= 2 main_~len~0)} is VALID [2020-07-08 12:28:11,050 INFO L280 TraceCheckUtils]: 22: Hoare triple {1362#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1378#(<= 1 main_~i~0)} is VALID [2020-07-08 12:28:11,052 INFO L280 TraceCheckUtils]: 23: Hoare triple {1378#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {1358#false} is VALID [2020-07-08 12:28:11,052 INFO L280 TraceCheckUtils]: 24: Hoare triple {1358#false} ~i~0 := ~len~0 - 1; {1358#false} is VALID [2020-07-08 12:28:11,052 INFO L280 TraceCheckUtils]: 25: Hoare triple {1358#false} assume !!(~i~0 <= 0);~expected~0 := ~i~0 + ~len~0; {1358#false} is VALID [2020-07-08 12:28:11,052 INFO L263 TraceCheckUtils]: 26: Hoare triple {1358#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1357#true} is VALID [2020-07-08 12:28:11,053 INFO L280 TraceCheckUtils]: 27: Hoare triple {1357#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1357#true} is VALID [2020-07-08 12:28:11,053 INFO L280 TraceCheckUtils]: 28: Hoare triple {1357#true} assume !(~index > 0); {1357#true} is VALID [2020-07-08 12:28:11,053 INFO L280 TraceCheckUtils]: 29: Hoare triple {1357#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1357#true} is VALID [2020-07-08 12:28:11,053 INFO L280 TraceCheckUtils]: 30: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-08 12:28:11,054 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1357#true} {1358#false} #148#return; {1358#false} is VALID [2020-07-08 12:28:11,054 INFO L280 TraceCheckUtils]: 32: Hoare triple {1358#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1358#false} is VALID [2020-07-08 12:28:11,054 INFO L280 TraceCheckUtils]: 33: Hoare triple {1358#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1358#false} is VALID [2020-07-08 12:28:11,054 INFO L280 TraceCheckUtils]: 34: Hoare triple {1358#false} assume !false; {1358#false} is VALID [2020-07-08 12:28:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:28:11,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518115322] [2020-07-08 12:28:11,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:28:11,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:28:11,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016613518] [2020-07-08 12:28:11,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 12:28:11,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:11,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:28:11,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:11,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:28:11,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:28:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:28:11,094 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2020-07-08 12:28:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:11,466 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-08 12:28:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:28:11,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 12:28:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:28:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2020-07-08 12:28:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:28:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2020-07-08 12:28:11,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2020-07-08 12:28:11,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:11,537 INFO L225 Difference]: With dead ends: 49 [2020-07-08 12:28:11,537 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:28:11,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:28:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:28:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:28:11,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:11,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:11,538 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:11,539 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:11,539 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:28:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:28:11,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:11,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:11,541 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:11,541 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:11,541 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:28:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:28:11,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:11,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:11,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:11,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:28:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:28:11,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-07-08 12:28:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:11,543 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:28:11,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:28:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:28:11,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:11,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:28:11,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:28:11,846 INFO L264 CegarLoopResult]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:11,847 INFO L268 CegarLoopResult]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2020-07-08 12:28:11,847 INFO L264 CegarLoopResult]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:11,847 INFO L268 CegarLoopResult]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2020-07-08 12:28:11,847 INFO L268 CegarLoopResult]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2020-07-08 12:28:11,847 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:28:11,847 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 12:28:11,847 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:28:11,847 INFO L271 CegarLoopResult]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2020-07-08 12:28:11,847 INFO L268 CegarLoopResult]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2020-07-08 12:28:11,848 INFO L271 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: true [2020-07-08 12:28:11,848 INFO L268 CegarLoopResult]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2020-07-08 12:28:11,848 INFO L264 CegarLoopResult]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:11,848 INFO L271 CegarLoopResult]: At program point L576-2(lines 576 589) the Hoare annotation is: true [2020-07-08 12:28:11,848 INFO L268 CegarLoopResult]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2020-07-08 12:28:11,848 INFO L268 CegarLoopResult]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2020-07-08 12:28:11,848 INFO L271 CegarLoopResult]: At program point L579(line 579) the Hoare annotation is: true [2020-07-08 12:28:11,848 INFO L268 CegarLoopResult]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2020-07-08 12:28:11,848 INFO L268 CegarLoopResult]: For program point L584(lines 584 586) no Hoare annotation was computed. [2020-07-08 12:28:11,848 INFO L268 CegarLoopResult]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point L578(lines 578 580) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:28:11,849 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:28:11,849 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L271 CegarLoopResult]: At program point L600-2(lines 600 603) the Hoare annotation is: true [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L271 CegarLoopResult]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point L628(line 628) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L264 CegarLoopResult]: At program point L624(line 624) the Hoare annotation is: false [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point L624-1(line 624) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2020-07-08 12:28:11,850 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2020-07-08 12:28:11,851 INFO L264 CegarLoopResult]: At program point L620(line 620) the Hoare annotation is: (<= 2 main_~len~0) [2020-07-08 12:28:11,851 INFO L268 CegarLoopResult]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2020-07-08 12:28:11,851 INFO L268 CegarLoopResult]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2020-07-08 12:28:11,851 INFO L264 CegarLoopResult]: At program point L622-3(lines 622 627) the Hoare annotation is: (and (<= 2 main_~len~0) (<= 1 main_~i~0)) [2020-07-08 12:28:11,851 INFO L271 CegarLoopResult]: At program point L622-4(lines 622 627) the Hoare annotation is: true [2020-07-08 12:28:11,851 INFO L264 CegarLoopResult]: At program point L616(line 616) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (<= 2 main_~len~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:11,851 INFO L264 CegarLoopResult]: At program point L618-2(lines 618 621) the Hoare annotation is: (<= 2 main_~len~0) [2020-07-08 12:28:11,851 INFO L268 CegarLoopResult]: For program point L616-1(line 616) no Hoare annotation was computed. [2020-07-08 12:28:11,851 INFO L268 CegarLoopResult]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:11,852 INFO L264 CegarLoopResult]: At program point L625(lines 613 632) the Hoare annotation is: false [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L264 CegarLoopResult]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-08 12:28:11,852 INFO L271 CegarLoopResult]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point L567(line 567) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point L566(lines 566 568) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2020-07-08 12:28:11,852 INFO L268 CegarLoopResult]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2020-07-08 12:28:11,856 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:28:11,857 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-08 12:28:11,857 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-08 12:28:11,858 WARN L170 areAnnotationChecker]: node_createENTRY has no Hoare annotation [2020-07-08 12:28:11,858 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-08 12:28:11,858 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-08 12:28:11,858 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:28:11,859 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-08 12:28:11,859 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-08 12:28:11,859 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-08 12:28:11,859 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-08 12:28:11,859 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:28:11,863 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-08 12:28:11,864 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-08 12:28:11,864 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-08 12:28:11,864 WARN L170 areAnnotationChecker]: L616-1 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-08 12:28:11,865 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L616-1 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: dll_update_atFINAL has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: dll_get_data_atFINAL has no Hoare annotation [2020-07-08 12:28:11,866 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-08 12:28:11,867 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-08 12:28:11,867 WARN L170 areAnnotationChecker]: dll_destroyEXIT has no Hoare annotation [2020-07-08 12:28:11,867 WARN L170 areAnnotationChecker]: node_createFINAL has no Hoare annotation [2020-07-08 12:28:11,867 WARN L170 areAnnotationChecker]: dll_update_atEXIT has no Hoare annotation [2020-07-08 12:28:11,867 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2020-07-08 12:28:11,867 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-08 12:28:11,868 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-08 12:28:11,868 WARN L170 areAnnotationChecker]: dll_get_data_atEXIT has no Hoare annotation [2020-07-08 12:28:11,868 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-08 12:28:11,868 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-08 12:28:11,870 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2020-07-08 12:28:11,870 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-08 12:28:11,870 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2020-07-08 12:28:11,870 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2020-07-08 12:28:11,871 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:28:11,871 WARN L170 areAnnotationChecker]: L624-2 has no Hoare annotation [2020-07-08 12:28:11,871 WARN L170 areAnnotationChecker]: L624-2 has no Hoare annotation [2020-07-08 12:28:11,871 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2020-07-08 12:28:11,872 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2020-07-08 12:28:11,872 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:28:11,872 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:28:11,872 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:28:11,872 WARN L170 areAnnotationChecker]: L622-2 has no Hoare annotation [2020-07-08 12:28:11,873 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:28:11,882 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:28:11 BoogieIcfgContainer [2020-07-08 12:28:11,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:28:11,893 INFO L168 Benchmark]: Toolchain (without parser) took 8063.27 ms. Allocated memory was 145.8 MB in the beginning and 313.0 MB in the end (delta: 167.2 MB). Free memory was 100.9 MB in the beginning and 109.5 MB in the end (delta: -8.6 MB). Peak memory consumption was 158.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,893 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.91 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 166.4 MB in the end (delta: -65.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,895 INFO L168 Benchmark]: Boogie Preprocessor took 77.60 ms. Allocated memory is still 203.9 MB. Free memory was 166.4 MB in the beginning and 162.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,896 INFO L168 Benchmark]: RCFGBuilder took 885.13 ms. Allocated memory is still 203.9 MB. Free memory was 162.5 MB in the beginning and 97.8 MB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,897 INFO L168 Benchmark]: TraceAbstraction took 6313.41 ms. Allocated memory was 203.9 MB in the beginning and 313.0 MB in the end (delta: 109.1 MB). Free memory was 97.1 MB in the beginning and 109.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:11,901 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.75 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.91 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 166.4 MB in the end (delta: -65.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.60 ms. Allocated memory is still 203.9 MB. Free memory was 166.4 MB in the beginning and 162.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.13 ms. Allocated memory is still 203.9 MB. Free memory was 162.5 MB in the beginning and 97.8 MB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6313.41 ms. Allocated memory was 203.9 MB in the beginning and 313.0 MB in the end (delta: 109.1 MB). Free memory was 97.1 MB in the beginning and 109.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 2 <= len - InvariantResult [Line: 607]: Loop Invariant [2020-07-08 12:28:11,917 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,918 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,921 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:11,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:11,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:11,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:11,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 2 <= len && 1 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 215 SDslu, 274 SDs, 0 SdLazy, 463 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 46 PreInvPairs, 60 NumberOfFragments, 109 HoareAnnotationTreeSize, 46 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 115 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 10665 SizeOfPredicates, 2 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...