java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:25:35,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:25:35,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:25:35,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:25:35,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:25:35,900 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:25:35,901 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:25:35,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:25:35,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:25:35,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:25:35,907 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:25:35,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:25:35,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:25:35,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:25:35,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:25:35,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:25:35,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:25:35,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:25:35,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:25:35,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:25:35,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:25:35,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:25:35,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:25:35,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:25:35,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:25:35,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:25:35,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:25:35,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:25:35,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:25:35,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:25:35,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:25:35,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:25:35,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:25:35,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:25:35,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:25:35,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:25:35,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:25:35,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:25:35,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:25:35,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:25:35,966 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:25:35,967 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:25:35,967 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:25:35,968 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:25:35,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:25:35,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:25:35,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:25:35,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:25:35,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:25:35,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:25:35,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:25:35,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:25:35,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:25:35,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:25:35,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:25:35,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:25:35,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:25:35,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:25:35,972 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:25:35,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:25:35,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:25:35,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:25:35,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:25:35,973 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:25:35,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:25:35,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:25:35,974 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:25:36,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:25:36,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:25:36,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:25:36,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:25:36,068 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:25:36,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:36,150 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7238835/c292b072f2b6404e801f630bb88adfb4/FLAG812ae7748 [2018-11-14 17:25:36,718 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:25:36,719 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:36,733 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7238835/c292b072f2b6404e801f630bb88adfb4/FLAG812ae7748 [2018-11-14 17:25:36,748 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7238835/c292b072f2b6404e801f630bb88adfb4 [2018-11-14 17:25:36,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:25:36,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:25:36,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:25:36,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:25:36,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:25:36,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:36" (1/1) ... [2018-11-14 17:25:36,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f14d601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:36, skipping insertion in model container [2018-11-14 17:25:36,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:36" (1/1) ... [2018-11-14 17:25:36,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:25:36,845 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:25:37,281 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:25:37,297 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:25:37,383 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:25:37,469 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:25:37,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37 WrapperNode [2018-11-14 17:25:37,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:25:37,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:25:37,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:25:37,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:25:37,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (1/1) ... [2018-11-14 17:25:37,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:25:37,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:25:37,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:25:37,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:25:37,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (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 [2018-11-14 17:25:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:25:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:25:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:25:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:25:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:25:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 17:25:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 17:25:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-14 17:25:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-14 17:25:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-14 17:25:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:25:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:25:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:25:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:25:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:25:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:25:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:25:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:25:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:25:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:25:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:25:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:25:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:25:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:25:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:25:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:25:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:25:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:25:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:25:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:25:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:25:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:25:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:25:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:25:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:25:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:25:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:25:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:25:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:25:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:25:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:25:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:25:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:25:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:25:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:25:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:25:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:25:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:25:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:25:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:25:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:25:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:25:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:25:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:25:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:25:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:25:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:25:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:25:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:25:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:25:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:25:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:25:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:25:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:25:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:25:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:25:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:25:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:25:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:25:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:25:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:25:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 17:25:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:25:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:25:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:25:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 17:25:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-14 17:25:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:25:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:25:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-14 17:25:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:25:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-14 17:25:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:25:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:25:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:25:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:25:39,008 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:25:39,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:39 BoogieIcfgContainer [2018-11-14 17:25:39,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:25:39,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:25:39,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:25:39,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:25:39,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:25:36" (1/3) ... [2018-11-14 17:25:39,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493093d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:39, skipping insertion in model container [2018-11-14 17:25:39,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:37" (2/3) ... [2018-11-14 17:25:39,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493093d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:39, skipping insertion in model container [2018-11-14 17:25:39,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:39" (3/3) ... [2018-11-14 17:25:39,017 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:39,026 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:25:39,034 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:25:39,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:25:39,087 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:25:39,088 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:25:39,088 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:25:39,088 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:25:39,089 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:25:39,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:25:39,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:25:39,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:25:39,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:25:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-14 17:25:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:25:39,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:39,123 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:39,125 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:39,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1118075528, now seen corresponding path program 1 times [2018-11-14 17:25:39,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:39,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:39,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:39,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {69#true} call ULTIMATE.init(); {69#true} is VALID [2018-11-14 17:25:39,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {69#true} is VALID [2018-11-14 17:25:39,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {69#true} assume true; {69#true} is VALID [2018-11-14 17:25:39,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {69#true} {69#true} #164#return; {69#true} is VALID [2018-11-14 17:25:39,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {69#true} call #t~ret17 := main(); {69#true} is VALID [2018-11-14 17:25:39,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {69#true} ~len~0 := 2;~data~0 := 1; {69#true} is VALID [2018-11-14 17:25:39,352 INFO L256 TraceCheckUtils]: 6: Hoare triple {69#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {69#true} is VALID [2018-11-14 17:25:39,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {69#true} ~len := #in~len;~data := #in~data; {69#true} is VALID [2018-11-14 17:25:39,352 INFO L256 TraceCheckUtils]: 8: Hoare triple {69#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {69#true} is VALID [2018-11-14 17:25:39,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {69#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {69#true} is VALID [2018-11-14 17:25:39,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {69#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {69#true} is VALID [2018-11-14 17:25:39,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {69#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {69#true} is VALID [2018-11-14 17:25:39,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#true} assume true; {69#true} is VALID [2018-11-14 17:25:39,354 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {69#true} {69#true} #150#return; {69#true} is VALID [2018-11-14 17:25:39,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {69#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {69#true} is VALID [2018-11-14 17:25:39,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {69#true} assume !true; {70#false} is VALID [2018-11-14 17:25:39,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {70#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {70#false} is VALID [2018-11-14 17:25:39,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-14 17:25:39,367 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {70#false} {69#true} #156#return; {70#false} is VALID [2018-11-14 17:25:39,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {70#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {70#false} is VALID [2018-11-14 17:25:39,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {70#false} assume !true; {70#false} is VALID [2018-11-14 17:25:39,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {70#false} ~i~0 := ~len~0 - 1; {70#false} is VALID [2018-11-14 17:25:39,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-14 17:25:39,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {70#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {70#false} is VALID [2018-11-14 17:25:39,369 INFO L256 TraceCheckUtils]: 24: Hoare triple {70#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {69#true} is VALID [2018-11-14 17:25:39,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {69#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {69#true} is VALID [2018-11-14 17:25:39,370 INFO L273 TraceCheckUtils]: 26: Hoare triple {69#true} assume !true; {69#true} is VALID [2018-11-14 17:25:39,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {69#true} call #t~mem10 := read~int(~head.base, ~head.offset + 8, 4);#res := #t~mem10;havoc #t~mem10; {69#true} is VALID [2018-11-14 17:25:39,371 INFO L273 TraceCheckUtils]: 28: Hoare triple {69#true} assume true; {69#true} is VALID [2018-11-14 17:25:39,371 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {69#true} {70#false} #160#return; {70#false} is VALID [2018-11-14 17:25:39,372 INFO L273 TraceCheckUtils]: 30: Hoare triple {70#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {70#false} is VALID [2018-11-14 17:25:39,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {70#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {70#false} is VALID [2018-11-14 17:25:39,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {70#false} assume !false; {70#false} is VALID [2018-11-14 17:25:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:39,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:39,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:25:39,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-14 17:25:39,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:39,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:25:39,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:39,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:25:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:25:39,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:25:39,809 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-14 17:25:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,300 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2018-11-14 17:25:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:25:40,301 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-14 17:25:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:25:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-14 17:25:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:25:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-14 17:25:40,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 137 transitions. [2018-11-14 17:25:40,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:40,850 INFO L225 Difference]: With dead ends: 108 [2018-11-14 17:25:40,850 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:25:40,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:25:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:25:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 17:25:40,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:40,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 17:25:40,946 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 17:25:40,946 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 17:25:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,953 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 17:25:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 17:25:40,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:40,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:40,954 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 17:25:40,955 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 17:25:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,960 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 17:25:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 17:25:40,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:40,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:40,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:40,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:25:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-14 17:25:40,969 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 33 [2018-11-14 17:25:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:40,969 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-14 17:25:40,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:25:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 17:25:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:25:40,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:40,972 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:40,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:40,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash -318771210, now seen corresponding path program 1 times [2018-11-14 17:25:40,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:40,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:40,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:40,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:40,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:41,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-14 17:25:41,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {386#true} is VALID [2018-11-14 17:25:41,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:25:41,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #164#return; {386#true} is VALID [2018-11-14 17:25:41,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret17 := main(); {386#true} is VALID [2018-11-14 17:25:41,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} ~len~0 := 2;~data~0 := 1; {388#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:41,167 INFO L256 TraceCheckUtils]: 6: Hoare triple {388#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {386#true} is VALID [2018-11-14 17:25:41,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#true} ~len := #in~len;~data := #in~data; {386#true} is VALID [2018-11-14 17:25:41,167 INFO L256 TraceCheckUtils]: 8: Hoare triple {386#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {386#true} is VALID [2018-11-14 17:25:41,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {386#true} is VALID [2018-11-14 17:25:41,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {386#true} is VALID [2018-11-14 17:25:41,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {386#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {386#true} is VALID [2018-11-14 17:25:41,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:25:41,169 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {386#true} {386#true} #150#return; {386#true} is VALID [2018-11-14 17:25:41,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {386#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {386#true} is VALID [2018-11-14 17:25:41,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:25:41,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {386#true} assume !(~len > 1); {386#true} is VALID [2018-11-14 17:25:41,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {386#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {386#true} is VALID [2018-11-14 17:25:41,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:25:41,173 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {386#true} {388#(<= 2 main_~len~0)} #156#return; {388#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:41,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {388#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {389#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:41,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {389#(<= 1 main_~i~0)} assume true; {389#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:41,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {389#(<= 1 main_~i~0)} assume !(~i~0 > -1); {387#false} is VALID [2018-11-14 17:25:41,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {387#false} ~i~0 := ~len~0 - 1; {387#false} is VALID [2018-11-14 17:25:41,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {387#false} assume true; {387#false} is VALID [2018-11-14 17:25:41,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {387#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {387#false} is VALID [2018-11-14 17:25:41,179 INFO L256 TraceCheckUtils]: 26: Hoare triple {387#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {386#true} is VALID [2018-11-14 17:25:41,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {386#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {386#true} is VALID [2018-11-14 17:25:41,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:25:41,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {386#true} assume !(~index > 0); {386#true} is VALID [2018-11-14 17:25:41,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {386#true} call #t~mem10 := read~int(~head.base, ~head.offset + 8, 4);#res := #t~mem10;havoc #t~mem10; {386#true} is VALID [2018-11-14 17:25:41,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:25:41,183 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {386#true} {387#false} #160#return; {387#false} is VALID [2018-11-14 17:25:41,184 INFO L273 TraceCheckUtils]: 33: Hoare triple {387#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {387#false} is VALID [2018-11-14 17:25:41,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {387#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {387#false} is VALID [2018-11-14 17:25:41,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-14 17:25:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:41,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:41,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:25:41,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:25:41,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:41,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:25:41,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:41,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:25:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:25:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:25:41,333 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 4 states. [2018-11-14 17:25:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:41,715 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-11-14 17:25:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:25:41,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:25:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:25:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 17:25:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:25:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 17:25:41,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-14 17:25:41,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:41,863 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:25:41,863 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 17:25:41,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:25:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 17:25:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-11-14 17:25:41,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:41,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 52 states. [2018-11-14 17:25:41,936 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 52 states. [2018-11-14 17:25:41,937 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 52 states. [2018-11-14 17:25:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:41,943 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 17:25:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-14 17:25:41,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:41,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:41,945 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 62 states. [2018-11-14 17:25:41,945 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 62 states. [2018-11-14 17:25:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:41,950 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 17:25:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-14 17:25:41,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:41,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:41,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:41,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:25:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-14 17:25:41,957 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 36 [2018-11-14 17:25:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:41,957 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-14 17:25:41,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:25:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-14 17:25:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:25:41,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:41,959 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:41,960 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:41,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash 484336529, now seen corresponding path program 1 times [2018-11-14 17:25:41,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:41,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:42,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-14 17:25:42,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {696#true} is VALID [2018-11-14 17:25:42,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 17:25:42,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #164#return; {696#true} is VALID [2018-11-14 17:25:42,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret17 := main(); {696#true} is VALID [2018-11-14 17:25:42,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} ~len~0 := 2;~data~0 := 1; {698#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:42,135 INFO L256 TraceCheckUtils]: 6: Hoare triple {698#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {696#true} is VALID [2018-11-14 17:25:42,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#true} ~len := #in~len;~data := #in~data; {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:42,139 INFO L256 TraceCheckUtils]: 8: Hoare triple {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {696#true} is VALID [2018-11-14 17:25:42,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {696#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {696#true} is VALID [2018-11-14 17:25:42,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {696#true} is VALID [2018-11-14 17:25:42,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {696#true} is VALID [2018-11-14 17:25:42,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 17:25:42,141 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {696#true} {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} #150#return; {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:42,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:42,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:42,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {699#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !(~len > 1); {700#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:25:42,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {700#(<= |dll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {700#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:25:42,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {700#(<= |dll_circular_create_#in~len| 1)} assume true; {700#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:25:42,149 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {700#(<= |dll_circular_create_#in~len| 1)} {698#(<= 2 main_~len~0)} #156#return; {697#false} is VALID [2018-11-14 17:25:42,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {697#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {697#false} is VALID [2018-11-14 17:25:42,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {697#false} assume true; {697#false} is VALID [2018-11-14 17:25:42,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {697#false} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {697#false} is VALID [2018-11-14 17:25:42,150 INFO L256 TraceCheckUtils]: 23: Hoare triple {697#false} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {696#true} is VALID [2018-11-14 17:25:42,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {696#true} is VALID [2018-11-14 17:25:42,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 17:25:42,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {696#true} assume !(~index > 0); {696#true} is VALID [2018-11-14 17:25:42,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {696#true} call write~int(~data, ~head.base, ~head.offset + 8, 4); {696#true} is VALID [2018-11-14 17:25:42,152 INFO L273 TraceCheckUtils]: 28: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 17:25:42,152 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {696#true} {697#false} #158#return; {697#false} is VALID [2018-11-14 17:25:42,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {697#false} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {697#false} is VALID [2018-11-14 17:25:42,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {697#false} assume true; {697#false} is VALID [2018-11-14 17:25:42,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {697#false} assume !(~i~0 > -1); {697#false} is VALID [2018-11-14 17:25:42,153 INFO L273 TraceCheckUtils]: 33: Hoare triple {697#false} ~i~0 := ~len~0 - 1; {697#false} is VALID [2018-11-14 17:25:42,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {697#false} assume true; {697#false} is VALID [2018-11-14 17:25:42,154 INFO L273 TraceCheckUtils]: 35: Hoare triple {697#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {697#false} is VALID [2018-11-14 17:25:42,154 INFO L256 TraceCheckUtils]: 36: Hoare triple {697#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {696#true} is VALID [2018-11-14 17:25:42,154 INFO L273 TraceCheckUtils]: 37: Hoare triple {696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {696#true} is VALID [2018-11-14 17:25:42,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 17:25:42,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {696#true} assume !(~index > 0); {696#true} is VALID [2018-11-14 17:25:42,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {696#true} call #t~mem10 := read~int(~head.base, ~head.offset + 8, 4);#res := #t~mem10;havoc #t~mem10; {696#true} is VALID [2018-11-14 17:25:42,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 17:25:42,156 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {696#true} {697#false} #160#return; {697#false} is VALID [2018-11-14 17:25:42,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {697#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {697#false} is VALID [2018-11-14 17:25:42,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {697#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {697#false} is VALID [2018-11-14 17:25:42,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-14 17:25:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:25:42,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:25:42,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-14 17:25:42,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:42,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:25:42,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:42,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:25:42,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:25:42,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:25:42,259 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-11-14 17:25:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:42,608 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-14 17:25:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:25:42,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-14 17:25:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:25:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2018-11-14 17:25:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:25:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2018-11-14 17:25:42,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2018-11-14 17:25:42,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:42,815 INFO L225 Difference]: With dead ends: 89 [2018-11-14 17:25:42,816 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:25:42,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:25:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:25:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-14 17:25:42,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:42,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 54 states. [2018-11-14 17:25:42,894 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 54 states. [2018-11-14 17:25:42,894 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 54 states. [2018-11-14 17:25:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:42,898 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 17:25:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-14 17:25:42,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:42,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:42,900 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 58 states. [2018-11-14 17:25:42,900 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 58 states. [2018-11-14 17:25:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:42,904 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 17:25:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-14 17:25:42,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:42,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:42,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:42,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:25:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-14 17:25:42,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 46 [2018-11-14 17:25:42,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:42,909 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-14 17:25:42,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:25:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 17:25:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 17:25:42,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:42,912 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:42,912 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:42,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2064365523, now seen corresponding path program 1 times [2018-11-14 17:25:42,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:42,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:43,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {1017#true} call ULTIMATE.init(); {1017#true} is VALID [2018-11-14 17:25:43,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {1017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1017#true} is VALID [2018-11-14 17:25:43,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1017#true} {1017#true} #164#return; {1017#true} is VALID [2018-11-14 17:25:43,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {1017#true} call #t~ret17 := main(); {1017#true} is VALID [2018-11-14 17:25:43,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {1017#true} ~len~0 := 2;~data~0 := 1; {1019#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:43,080 INFO L256 TraceCheckUtils]: 6: Hoare triple {1019#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1017#true} is VALID [2018-11-14 17:25:43,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {1017#true} ~len := #in~len;~data := #in~data; {1017#true} is VALID [2018-11-14 17:25:43,081 INFO L256 TraceCheckUtils]: 8: Hoare triple {1017#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1017#true} is VALID [2018-11-14 17:25:43,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {1017#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1017#true} is VALID [2018-11-14 17:25:43,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {1017#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1017#true} is VALID [2018-11-14 17:25:43,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {1017#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,082 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1017#true} {1017#true} #150#return; {1017#true} is VALID [2018-11-14 17:25:43,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {1017#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {1017#true} assume !!(~len > 1); {1017#true} is VALID [2018-11-14 17:25:43,084 INFO L256 TraceCheckUtils]: 17: Hoare triple {1017#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1017#true} is VALID [2018-11-14 17:25:43,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {1017#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1017#true} is VALID [2018-11-14 17:25:43,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {1017#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1017#true} is VALID [2018-11-14 17:25:43,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {1017#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,085 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1017#true} {1017#true} #152#return; {1017#true} is VALID [2018-11-14 17:25:43,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {1017#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4); {1017#true} is VALID [2018-11-14 17:25:43,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {1017#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {1017#true} is VALID [2018-11-14 17:25:43,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {1017#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1017#true} is VALID [2018-11-14 17:25:43,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {1017#true} assume !(~len > 1); {1017#true} is VALID [2018-11-14 17:25:43,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {1017#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,097 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1017#true} {1019#(<= 2 main_~len~0)} #156#return; {1019#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:43,119 INFO L273 TraceCheckUtils]: 31: Hoare triple {1019#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {1020#(<= 1 main_~i~0)} assume true; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,150 INFO L273 TraceCheckUtils]: 33: Hoare triple {1020#(<= 1 main_~i~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,150 INFO L256 TraceCheckUtils]: 34: Hoare triple {1020#(<= 1 main_~i~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1017#true} is VALID [2018-11-14 17:25:43,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {1017#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1017#true} is VALID [2018-11-14 17:25:43,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {1017#true} assume !(~index > 0); {1017#true} is VALID [2018-11-14 17:25:43,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {1017#true} call write~int(~data, ~head.base, ~head.offset + 8, 4); {1017#true} is VALID [2018-11-14 17:25:43,152 INFO L273 TraceCheckUtils]: 39: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,159 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1017#true} {1020#(<= 1 main_~i~0)} #158#return; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,160 INFO L273 TraceCheckUtils]: 41: Hoare triple {1020#(<= 1 main_~i~0)} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {1021#(<= 0 main_~i~0)} is VALID [2018-11-14 17:25:43,164 INFO L273 TraceCheckUtils]: 42: Hoare triple {1021#(<= 0 main_~i~0)} assume true; {1021#(<= 0 main_~i~0)} is VALID [2018-11-14 17:25:43,164 INFO L273 TraceCheckUtils]: 43: Hoare triple {1021#(<= 0 main_~i~0)} assume !(~i~0 > -1); {1018#false} is VALID [2018-11-14 17:25:43,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {1018#false} ~i~0 := ~len~0 - 1; {1018#false} is VALID [2018-11-14 17:25:43,165 INFO L273 TraceCheckUtils]: 45: Hoare triple {1018#false} assume true; {1018#false} is VALID [2018-11-14 17:25:43,165 INFO L273 TraceCheckUtils]: 46: Hoare triple {1018#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {1018#false} is VALID [2018-11-14 17:25:43,165 INFO L256 TraceCheckUtils]: 47: Hoare triple {1018#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1017#true} is VALID [2018-11-14 17:25:43,165 INFO L273 TraceCheckUtils]: 48: Hoare triple {1017#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1017#true} is VALID [2018-11-14 17:25:43,166 INFO L273 TraceCheckUtils]: 49: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,166 INFO L273 TraceCheckUtils]: 50: Hoare triple {1017#true} assume !(~index > 0); {1017#true} is VALID [2018-11-14 17:25:43,166 INFO L273 TraceCheckUtils]: 51: Hoare triple {1017#true} call #t~mem10 := read~int(~head.base, ~head.offset + 8, 4);#res := #t~mem10;havoc #t~mem10; {1017#true} is VALID [2018-11-14 17:25:43,166 INFO L273 TraceCheckUtils]: 52: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,166 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1017#true} {1018#false} #160#return; {1018#false} is VALID [2018-11-14 17:25:43,169 INFO L273 TraceCheckUtils]: 54: Hoare triple {1018#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1018#false} is VALID [2018-11-14 17:25:43,169 INFO L273 TraceCheckUtils]: 55: Hoare triple {1018#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1018#false} is VALID [2018-11-14 17:25:43,169 INFO L273 TraceCheckUtils]: 56: Hoare triple {1018#false} assume !false; {1018#false} is VALID [2018-11-14 17:25:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:25:43,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:25:43,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:25:43,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:43,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:25:43,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {1017#true} call ULTIMATE.init(); {1017#true} is VALID [2018-11-14 17:25:43,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {1017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1017#true} is VALID [2018-11-14 17:25:43,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1017#true} {1017#true} #164#return; {1017#true} is VALID [2018-11-14 17:25:43,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {1017#true} call #t~ret17 := main(); {1017#true} is VALID [2018-11-14 17:25:43,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {1017#true} ~len~0 := 2;~data~0 := 1; {1019#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:43,715 INFO L256 TraceCheckUtils]: 6: Hoare triple {1019#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1017#true} is VALID [2018-11-14 17:25:43,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {1017#true} ~len := #in~len;~data := #in~data; {1017#true} is VALID [2018-11-14 17:25:43,716 INFO L256 TraceCheckUtils]: 8: Hoare triple {1017#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1017#true} is VALID [2018-11-14 17:25:43,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {1017#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1017#true} is VALID [2018-11-14 17:25:43,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {1017#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1017#true} is VALID [2018-11-14 17:25:43,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {1017#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,717 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1017#true} {1017#true} #150#return; {1017#true} is VALID [2018-11-14 17:25:43,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {1017#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {1017#true} assume !!(~len > 1); {1017#true} is VALID [2018-11-14 17:25:43,718 INFO L256 TraceCheckUtils]: 17: Hoare triple {1017#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1017#true} is VALID [2018-11-14 17:25:43,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {1017#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1017#true} is VALID [2018-11-14 17:25:43,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {1017#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1017#true} is VALID [2018-11-14 17:25:43,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {1017#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,719 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1017#true} {1017#true} #152#return; {1017#true} is VALID [2018-11-14 17:25:43,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {1017#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4); {1017#true} is VALID [2018-11-14 17:25:43,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {1017#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {1017#true} is VALID [2018-11-14 17:25:43,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {1017#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1017#true} is VALID [2018-11-14 17:25:43,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {1017#true} assume !(~len > 1); {1017#true} is VALID [2018-11-14 17:25:43,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {1017#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1017#true} is VALID [2018-11-14 17:25:43,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {1017#true} assume true; {1017#true} is VALID [2018-11-14 17:25:43,723 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1017#true} {1019#(<= 2 main_~len~0)} #156#return; {1019#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:43,723 INFO L273 TraceCheckUtils]: 31: Hoare triple {1019#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {1020#(<= 1 main_~i~0)} assume true; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {1020#(<= 1 main_~i~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {1020#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:43,726 INFO L256 TraceCheckUtils]: 34: Hoare triple {1020#(<= 1 main_~i~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1017#true} is VALID [2018-11-14 17:25:43,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {1017#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1130#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} is VALID [2018-11-14 17:25:43,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {1130#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} assume true; {1130#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} is VALID [2018-11-14 17:25:43,727 INFO L273 TraceCheckUtils]: 37: Hoare triple {1130#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} assume !(~index > 0); {1137#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-14 17:25:43,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {1137#(<= |dll_circular_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset + 8, 4); {1137#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-14 17:25:43,728 INFO L273 TraceCheckUtils]: 39: Hoare triple {1137#(<= |dll_circular_update_at_#in~index| 0)} assume true; {1137#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-14 17:25:43,730 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1137#(<= |dll_circular_update_at_#in~index| 0)} {1020#(<= 1 main_~i~0)} #158#return; {1018#false} is VALID [2018-11-14 17:25:43,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {1018#false} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {1018#false} is VALID [2018-11-14 17:25:43,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {1018#false} assume true; {1018#false} is VALID [2018-11-14 17:25:43,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {1018#false} assume !(~i~0 > -1); {1018#false} is VALID [2018-11-14 17:25:43,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {1018#false} ~i~0 := ~len~0 - 1; {1018#false} is VALID [2018-11-14 17:25:43,731 INFO L273 TraceCheckUtils]: 45: Hoare triple {1018#false} assume true; {1018#false} is VALID [2018-11-14 17:25:43,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {1018#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {1018#false} is VALID [2018-11-14 17:25:43,732 INFO L256 TraceCheckUtils]: 47: Hoare triple {1018#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1018#false} is VALID [2018-11-14 17:25:43,732 INFO L273 TraceCheckUtils]: 48: Hoare triple {1018#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1018#false} is VALID [2018-11-14 17:25:43,733 INFO L273 TraceCheckUtils]: 49: Hoare triple {1018#false} assume true; {1018#false} is VALID [2018-11-14 17:25:43,733 INFO L273 TraceCheckUtils]: 50: Hoare triple {1018#false} assume !(~index > 0); {1018#false} is VALID [2018-11-14 17:25:43,734 INFO L273 TraceCheckUtils]: 51: Hoare triple {1018#false} call #t~mem10 := read~int(~head.base, ~head.offset + 8, 4);#res := #t~mem10;havoc #t~mem10; {1018#false} is VALID [2018-11-14 17:25:43,734 INFO L273 TraceCheckUtils]: 52: Hoare triple {1018#false} assume true; {1018#false} is VALID [2018-11-14 17:25:43,734 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1018#false} {1018#false} #160#return; {1018#false} is VALID [2018-11-14 17:25:43,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {1018#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1018#false} is VALID [2018-11-14 17:25:43,735 INFO L273 TraceCheckUtils]: 55: Hoare triple {1018#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1018#false} is VALID [2018-11-14 17:25:43,735 INFO L273 TraceCheckUtils]: 56: Hoare triple {1018#false} assume !false; {1018#false} is VALID [2018-11-14 17:25:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:25:43,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:25:43,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 7 [2018-11-14 17:25:43,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-14 17:25:43,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:43,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:25:43,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:43,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:25:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:25:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:25:43,917 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 7 states. [2018-11-14 17:25:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:44,656 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-14 17:25:44,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:25:44,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-14 17:25:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:25:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2018-11-14 17:25:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:25:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2018-11-14 17:25:44,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 110 transitions. [2018-11-14 17:25:44,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:44,807 INFO L225 Difference]: With dead ends: 98 [2018-11-14 17:25:44,808 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 17:25:44,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:25:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 17:25:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-11-14 17:25:44,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:44,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 63 states. [2018-11-14 17:25:44,908 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 63 states. [2018-11-14 17:25:44,908 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 63 states. [2018-11-14 17:25:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:44,913 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-14 17:25:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-14 17:25:44,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:44,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:44,914 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 73 states. [2018-11-14 17:25:44,914 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 73 states. [2018-11-14 17:25:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:44,919 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-14 17:25:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-14 17:25:44,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:44,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:44,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:44,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:25:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-11-14 17:25:44,924 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 57 [2018-11-14 17:25:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:44,924 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-14 17:25:44,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:25:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-14 17:25:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 17:25:44,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:44,927 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:44,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:44,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1550066504, now seen corresponding path program 1 times [2018-11-14 17:25:44,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:44,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:44,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:44,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:44,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:45,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2018-11-14 17:25:45,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {1568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1568#true} is VALID [2018-11-14 17:25:45,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1568#true} {1568#true} #164#return; {1568#true} is VALID [2018-11-14 17:25:45,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {1568#true} call #t~ret17 := main(); {1568#true} is VALID [2018-11-14 17:25:45,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {1568#true} ~len~0 := 2;~data~0 := 1; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,120 INFO L256 TraceCheckUtils]: 6: Hoare triple {1570#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1568#true} is VALID [2018-11-14 17:25:45,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {1568#true} ~len := #in~len;~data := #in~data; {1568#true} is VALID [2018-11-14 17:25:45,120 INFO L256 TraceCheckUtils]: 8: Hoare triple {1568#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1568#true} is VALID [2018-11-14 17:25:45,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {1568#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1568#true} is VALID [2018-11-14 17:25:45,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {1568#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1568#true} is VALID [2018-11-14 17:25:45,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {1568#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1568#true} is VALID [2018-11-14 17:25:45,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,121 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1568#true} {1568#true} #150#return; {1568#true} is VALID [2018-11-14 17:25:45,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {1568#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1568#true} is VALID [2018-11-14 17:25:45,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {1568#true} assume !!(~len > 1); {1568#true} is VALID [2018-11-14 17:25:45,122 INFO L256 TraceCheckUtils]: 17: Hoare triple {1568#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1568#true} is VALID [2018-11-14 17:25:45,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {1568#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1568#true} is VALID [2018-11-14 17:25:45,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {1568#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1568#true} is VALID [2018-11-14 17:25:45,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {1568#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1568#true} is VALID [2018-11-14 17:25:45,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,123 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1568#true} {1568#true} #152#return; {1568#true} is VALID [2018-11-14 17:25:45,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {1568#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4); {1568#true} is VALID [2018-11-14 17:25:45,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {1568#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {1568#true} is VALID [2018-11-14 17:25:45,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {1568#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1568#true} is VALID [2018-11-14 17:25:45,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {1568#true} assume !(~len > 1); {1568#true} is VALID [2018-11-14 17:25:45,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {1568#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1568#true} is VALID [2018-11-14 17:25:45,125 INFO L273 TraceCheckUtils]: 29: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,129 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1568#true} {1570#(<= 2 main_~len~0)} #156#return; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {1570#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,131 INFO L273 TraceCheckUtils]: 32: Hoare triple {1570#(<= 2 main_~len~0)} assume true; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,136 INFO L273 TraceCheckUtils]: 33: Hoare triple {1570#(<= 2 main_~len~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,137 INFO L256 TraceCheckUtils]: 34: Hoare triple {1570#(<= 2 main_~len~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1568#true} is VALID [2018-11-14 17:25:45,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {1568#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1568#true} is VALID [2018-11-14 17:25:45,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {1568#true} assume !!(~index > 0);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := #t~post12 - 1;havoc #t~post12; {1568#true} is VALID [2018-11-14 17:25:45,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {1568#true} assume !(~index > 0); {1568#true} is VALID [2018-11-14 17:25:45,138 INFO L273 TraceCheckUtils]: 40: Hoare triple {1568#true} call write~int(~data, ~head.base, ~head.offset + 8, 4); {1568#true} is VALID [2018-11-14 17:25:45,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,141 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1568#true} {1570#(<= 2 main_~len~0)} #158#return; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,141 INFO L273 TraceCheckUtils]: 43: Hoare triple {1570#(<= 2 main_~len~0)} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {1570#(<= 2 main_~len~0)} assume true; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {1570#(<= 2 main_~len~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,142 INFO L256 TraceCheckUtils]: 46: Hoare triple {1570#(<= 2 main_~len~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1568#true} is VALID [2018-11-14 17:25:45,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {1568#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1568#true} is VALID [2018-11-14 17:25:45,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {1568#true} assume !(~index > 0); {1568#true} is VALID [2018-11-14 17:25:45,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {1568#true} call write~int(~data, ~head.base, ~head.offset + 8, 4); {1568#true} is VALID [2018-11-14 17:25:45,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {1568#true} assume true; {1568#true} is VALID [2018-11-14 17:25:45,144 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1568#true} {1570#(<= 2 main_~len~0)} #158#return; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {1570#(<= 2 main_~len~0)} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {1570#(<= 2 main_~len~0)} assume true; {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {1570#(<= 2 main_~len~0)} assume !(~i~0 > -1); {1570#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:45,151 INFO L273 TraceCheckUtils]: 56: Hoare triple {1570#(<= 2 main_~len~0)} ~i~0 := ~len~0 - 1; {1571#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:45,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {1571#(<= 1 main_~i~0)} assume true; {1571#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:45,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {1571#(<= 1 main_~i~0)} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {1571#(<= 1 main_~i~0)} is VALID [2018-11-14 17:25:45,153 INFO L256 TraceCheckUtils]: 59: Hoare triple {1571#(<= 1 main_~i~0)} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1568#true} is VALID [2018-11-14 17:25:45,155 INFO L273 TraceCheckUtils]: 60: Hoare triple {1568#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1572#(<= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} is VALID [2018-11-14 17:25:45,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {1572#(<= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} assume true; {1572#(<= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} is VALID [2018-11-14 17:25:45,167 INFO L273 TraceCheckUtils]: 62: Hoare triple {1572#(<= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} assume !(~index > 0); {1573#(<= |dll_circular_get_data_at_#in~index| 0)} is VALID [2018-11-14 17:25:45,167 INFO L273 TraceCheckUtils]: 63: Hoare triple {1573#(<= |dll_circular_get_data_at_#in~index| 0)} call #t~mem10 := read~int(~head.base, ~head.offset + 8, 4);#res := #t~mem10;havoc #t~mem10; {1573#(<= |dll_circular_get_data_at_#in~index| 0)} is VALID [2018-11-14 17:25:45,168 INFO L273 TraceCheckUtils]: 64: Hoare triple {1573#(<= |dll_circular_get_data_at_#in~index| 0)} assume true; {1573#(<= |dll_circular_get_data_at_#in~index| 0)} is VALID [2018-11-14 17:25:45,169 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {1573#(<= |dll_circular_get_data_at_#in~index| 0)} {1571#(<= 1 main_~i~0)} #160#return; {1569#false} is VALID [2018-11-14 17:25:45,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {1569#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1569#false} is VALID [2018-11-14 17:25:45,169 INFO L273 TraceCheckUtils]: 67: Hoare triple {1569#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1569#false} is VALID [2018-11-14 17:25:45,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2018-11-14 17:25:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-14 17:25:45,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:45,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:25:45,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-14 17:25:45,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:45,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:25:45,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:45,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:25:45,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:25:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:25:45,279 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2018-11-14 17:25:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:45,867 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-11-14 17:25:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:25:45,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-14 17:25:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:25:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-14 17:25:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:25:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-14 17:25:45,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2018-11-14 17:25:46,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:46,165 INFO L225 Difference]: With dead ends: 90 [2018-11-14 17:25:46,165 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:25:46,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:25:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:25:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-11-14 17:25:46,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:46,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 71 states. [2018-11-14 17:25:46,231 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 71 states. [2018-11-14 17:25:46,232 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 71 states. [2018-11-14 17:25:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:46,236 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-14 17:25:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-14 17:25:46,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:46,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:46,237 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 76 states. [2018-11-14 17:25:46,237 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 76 states. [2018-11-14 17:25:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:46,242 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-14 17:25:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-14 17:25:46,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:46,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:46,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:46,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 17:25:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2018-11-14 17:25:46,247 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 69 [2018-11-14 17:25:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:46,247 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2018-11-14 17:25:46,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:25:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-11-14 17:25:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 17:25:46,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:46,249 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:46,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:46,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash -863024210, now seen corresponding path program 1 times [2018-11-14 17:25:46,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:47,841 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:25:47,847 INFO L168 Benchmark]: Toolchain (without parser) took 11087.04 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.5 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:47,849 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:25:47,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:47,851 INFO L168 Benchmark]: Boogie Preprocessor took 178.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:47,851 INFO L168 Benchmark]: RCFGBuilder took 1359.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:47,852 INFO L168 Benchmark]: TraceAbstraction took 8836.08 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 138.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -68.8 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:47,857 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1359.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8836.08 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 138.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -68.8 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...