java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:56:36,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:56:36,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:56:36,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:56:36,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:56:36,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:56:36,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:56:36,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:56:36,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:56:36,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:56:36,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:56:36,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:56:36,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:56:36,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:56:36,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:56:36,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:56:36,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:56:36,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:56:36,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:56:36,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:56:36,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:56:36,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:56:36,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:56:36,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:56:36,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:56:36,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:56:36,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:56:36,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:56:36,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:56:36,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:56:36,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:56:36,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:56:36,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:56:36,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:56:36,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:56:36,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:56:36,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:56:36,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:56:36,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:56:36,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:56:36,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:56:36,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:56:36,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:56:36,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:56:36,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:56:36,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:56:36,932 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:56:36,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:56:36,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:56:36,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:56:36,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:56:36,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:56:36,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:56:36,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:56:36,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:56:36,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:56:36,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:56:36,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:56:36,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:56:36,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:56:36,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:56:36,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:56:36,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:56:36,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:56:36,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:56:36,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:56:36,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:56:36,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:56:36,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:56:36,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:56:36,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:56:37,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:56:37,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:56:37,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:56:37,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:56:37,253 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:56:37,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i [2019-10-13 22:56:37,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c5e670a/59fd1b752abd49cc8b184e8926fd4008/FLAG96315331a [2019-10-13 22:56:37,924 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:56:37,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i [2019-10-13 22:56:37,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c5e670a/59fd1b752abd49cc8b184e8926fd4008/FLAG96315331a [2019-10-13 22:56:38,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c5e670a/59fd1b752abd49cc8b184e8926fd4008 [2019-10-13 22:56:38,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:56:38,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:56:38,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:56:38,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:56:38,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:56:38,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f632913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38, skipping insertion in model container [2019-10-13 22:56:38,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,233 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:56:38,277 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:56:38,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:56:38,781 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:56:38,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:56:38,890 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:56:38,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38 WrapperNode [2019-10-13 22:56:38,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:56:38,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:56:38,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:56:38,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:56:38,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (1/1) ... [2019-10-13 22:56:38,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:56:38,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:56:38,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:56:38,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:56:38,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (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 [2019-10-13 22:56:39,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:56:39,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:56:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 22:56:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 22:56:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 22:56:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-13 22:56:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-10-13 22:56:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_last [2019-10-13 22:56:39,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:56:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:56:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 22:56:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 22:56:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 22:56:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 22:56:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 22:56:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 22:56:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 22:56:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 22:56:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 22:56:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 22:56:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 22:56:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 22:56:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 22:56:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 22:56:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 22:56:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 22:56:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 22:56:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 22:56:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 22:56:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 22:56:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 22:56:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 22:56:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 22:56:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 22:56:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 22:56:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 22:56:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 22:56:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 22:56:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 22:56:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 22:56:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 22:56:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 22:56:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 22:56:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 22:56:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 22:56:39,048 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 22:56:39,048 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 22:56:39,048 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 22:56:39,048 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 22:56:39,048 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 22:56:39,048 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 22:56:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 22:56:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 22:56:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 22:56:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 22:56:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 22:56:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 22:56:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 22:56:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 22:56:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 22:56:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 22:56:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 22:56:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 22:56:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 22:56:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 22:56:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 22:56:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 22:56:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 22:56:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 22:56:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 22:56:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 22:56:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 22:56:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 22:56:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 22:56:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 22:56:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 22:56:39,054 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 22:56:39,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:56:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-10-13 22:56:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_last [2019-10-13 22:56:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 22:56:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:56:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:56:39,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:56:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 22:56:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:56:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:56:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:56:39,454 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 22:56:39,760 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:56:39,761 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 22:56:39,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:56:39 BoogieIcfgContainer [2019-10-13 22:56:39,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:56:39,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:56:39,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:56:39,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:56:39,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:56:38" (1/3) ... [2019-10-13 22:56:39,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b77f4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:56:39, skipping insertion in model container [2019-10-13 22:56:39,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:38" (2/3) ... [2019-10-13 22:56:39,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b77f4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:56:39, skipping insertion in model container [2019-10-13 22:56:39,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:56:39" (3/3) ... [2019-10-13 22:56:39,772 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2019-10-13 22:56:39,782 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:56:39,791 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:56:39,803 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:56:39,831 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:56:39,831 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:56:39,831 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:56:39,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:56:39,832 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:56:39,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:56:39,832 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:56:39,832 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:56:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-13 22:56:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:56:39,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:39,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:39,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:39,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1503477050, now seen corresponding path program 1 times [2019-10-13 22:56:39,878 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:39,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725104880] [2019-10-13 22:56:39,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:39,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:39,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:40,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725104880] [2019-10-13 22:56:40,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:56:40,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:56:40,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89427536] [2019-10-13 22:56:40,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:56:40,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:56:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:56:40,112 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2019-10-13 22:56:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:40,217 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-10-13 22:56:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:56:40,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 22:56:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:40,228 INFO L225 Difference]: With dead ends: 52 [2019-10-13 22:56:40,229 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 22:56:40,233 INFO L600 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 [2019-10-13 22:56:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 22:56:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-10-13 22:56:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 22:56:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-10-13 22:56:40,281 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2019-10-13 22:56:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:40,282 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-10-13 22:56:40,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:56:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-10-13 22:56:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:56:40,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:40,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:40,284 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash -886044635, now seen corresponding path program 1 times [2019-10-13 22:56:40,285 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:40,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195303562] [2019-10-13 22:56:40,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:40,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:40,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:40,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195303562] [2019-10-13 22:56:40,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652340196] [2019-10-13 22:56:40,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:40,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 22:56:40,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:56:40,642 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:56:40,718 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:56:40,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 10 [2019-10-13 22:56:40,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244662110] [2019-10-13 22:56:40,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:56:40,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:56:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:56:40,722 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-10-13 22:56:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:40,786 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-10-13 22:56:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:56:40,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 22:56:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:40,788 INFO L225 Difference]: With dead ends: 45 [2019-10-13 22:56:40,788 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 22:56:40,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-13 22:56:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 22:56:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-13 22:56:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 22:56:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-13 22:56:40,796 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-10-13 22:56:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:40,796 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-13 22:56:40,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:56:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-13 22:56:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 22:56:40,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:40,798 INFO L380 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] [2019-10-13 22:56:41,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:41,002 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash -497001908, now seen corresponding path program 1 times [2019-10-13 22:56:41,003 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:41,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114683975] [2019-10-13 22:56:41,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:41,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:41,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:56:41,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114683975] [2019-10-13 22:56:41,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:56:41,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:56:41,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097410586] [2019-10-13 22:56:41,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:56:41,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:41,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:56:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:56:41,168 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2019-10-13 22:56:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:41,338 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-10-13 22:56:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:56:41,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-13 22:56:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:41,339 INFO L225 Difference]: With dead ends: 40 [2019-10-13 22:56:41,339 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 22:56:41,340 INFO L600 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 [2019-10-13 22:56:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 22:56:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-13 22:56:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 22:56:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-13 22:56:41,345 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2019-10-13 22:56:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:41,346 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-13 22:56:41,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:56:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-13 22:56:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 22:56:41,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:41,349 INFO L380 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] [2019-10-13 22:56:41,349 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1275364761, now seen corresponding path program 1 times [2019-10-13 22:56:41,350 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:41,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476997420] [2019-10-13 22:56:41,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:41,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:41,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:41,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476997420] [2019-10-13 22:56:41,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268926648] [2019-10-13 22:56:41,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:41,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 22:56:41,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:56:41,694 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:56:41,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [704346402] [2019-10-13 22:56:41,844 INFO L162 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-10-13 22:56:41,844 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:41,851 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:41,861 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:41,861 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:42,021 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:42,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:42,610 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:43,012 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:43,793 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:43,804 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:43,990 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:44,006 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:44,781 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:44,786 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:45,396 INFO L199 IcfgInterpreter]: Interpreting procedure dll_create with input of size 44 for LOIs [2019-10-13 22:56:50,209 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:50,213 INFO L199 IcfgInterpreter]: Interpreting procedure dll_remove_last with input of size 35 for LOIs [2019-10-13 22:56:50,342 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:50,342 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:50,342 INFO L193 IcfgInterpreter]: Reachable states at location L599-3 satisfy 427#(and (<= dll_remove_last_~snd_to_last~0.offset 0) (<= 0 dll_remove_last_~head.offset) (<= dll_remove_last_~snd_to_last~0.base 0) (<= dll_remove_last_~head.offset 0) (<= 0 dll_remove_last_~snd_to_last~0.base) (or (and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.offset) (= 0 |#NULL.base|) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (= dll_remove_last_~snd_to_last~0.base 0) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.base) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)))) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.offset) (= 0 |#NULL.base|) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (= dll_remove_last_~snd_to_last~0.base 0) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.base) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)))) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |dll_remove_last_#in~head.offset|) (<= 0 dll_remove_last_~snd_to_last~0.offset)) [2019-10-13 22:56:50,343 INFO L193 IcfgInterpreter]: Reachable states at location L599-4 satisfy 437#(and (or (and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.offset) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0) (= 0 |#NULL.base|) (= dll_remove_last_~snd_to_last~0.base 0) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.base) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_last_~snd_to_last~0.offset 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (not (= |dll_remove_last_#in~head.base| 0)) (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)))) (= |#memory_int| |old(#memory_int)|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.offset) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0) (= 0 |#NULL.base|) (= dll_remove_last_~snd_to_last~0.base 0) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)))) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_last_~snd_to_last~0.offset 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (not (= |dll_remove_last_#in~head.base| 0)) (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0))) (<= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 dll_remove_last_~head.offset) (<= dll_remove_last_~snd_to_last~0.base 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= dll_remove_last_~head.offset 0) (<= 0 dll_remove_last_~snd_to_last~0.base) (<= 0 |dll_remove_last_#in~head.offset|) (<= 0 dll_remove_last_~snd_to_last~0.offset)) [2019-10-13 22:56:50,343 INFO L193 IcfgInterpreter]: Reachable states at location L615 satisfy 300#false [2019-10-13 22:56:50,343 INFO L193 IcfgInterpreter]: Reachable states at location L593 satisfy 422#(and (= 0 |#NULL.base|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= |dll_remove_last_#t~mem5.base| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) |dll_remove_last_#t~mem5.offset|) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 dll_remove_last_~head.offset) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (<= |#NULL.offset| 0) (<= dll_remove_last_~head.offset 0) (not (= |dll_remove_last_#in~head.base| 0)) (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |dll_remove_last_#t~mem5.base|) (+ |dll_remove_last_#t~mem5.offset| 4)) |dll_remove_last_#t~mem6.base|) (<= 0 |dll_remove_last_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (= |dll_remove_last_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |dll_remove_last_#t~mem5.base|) (+ |dll_remove_last_#t~mem5.offset| 4)))) [2019-10-13 22:56:50,343 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:50,344 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:50,344 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 328#(and (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| |main_~#s~0.base|)) (<= 0 |main_~#s~0.offset|) (<= 0 |#NULL.offset|) (<= 1 main_~i~0) (= main_~i~0 (+ main_~len~0 (- 1))) (<= main_~i~0 1) (= main_~len~0 2) (< |main_~#s~0.base| |#StackHeapBarrier|) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (<= |#NULL.base| 0) (= main_~data~0 1) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= |main_~#s~0.offset| 0) (= |main_~#s~0.offset| 0) (<= main_~data~0 1) (= |#NULL.offset| 0) (not (= |main_~#s~0.base| 0)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (<= 2 main_~len~0)) [2019-10-13 22:56:50,344 INFO L193 IcfgInterpreter]: Reachable states at location dll_createEXIT satisfy 394#(and (= |dll_create_#res.base| dll_create_~head~0.base) (= |dll_create_#res.offset| dll_create_~head~0.offset) (not (< 0 dll_create_~len)) (<= dll_create_~len 0)) [2019-10-13 22:56:50,344 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 272#false [2019-10-13 22:56:50,345 INFO L193 IcfgInterpreter]: Reachable states at location dll_remove_lastEXIT satisfy 447#(and (<= dll_remove_last_~snd_to_last~0.offset 0) (<= 0 dll_remove_last_~head.offset) (<= dll_remove_last_~snd_to_last~0.base 0) (<= dll_remove_last_~head.offset 0) (<= 0 dll_remove_last_~snd_to_last~0.base) (or (and (= 0 |#NULL.base|) (= (store |old(#memory_int)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_int)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) (select (select |#memory_int| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4)))) |#memory_int|) (= dll_remove_last_~snd_to_last~0.base 0) (= |#valid| (store |old(#valid)| dll_remove_last_~last~0.base 0)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)) 0)) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= dll_remove_last_~last~0.offset (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (= 0 (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4))) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= (store |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0))) (<= 0 |dll_remove_last_#in~head.offset|) (= dll_remove_last_~last~0.base (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0)) (and (= 0 |#NULL.base|) (= (store |old(#memory_int)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_int)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) (select (select |#memory_int| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4)))) |#memory_int|) (= dll_remove_last_~snd_to_last~0.base 0) (= |#valid| (store |old(#valid)| dll_remove_last_~last~0.base 0)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (not (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)) 0)) (= dll_remove_last_~last~0.offset (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (= 0 (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4))) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= (store |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0))) (<= 0 |dll_remove_last_#in~head.offset|) (= dll_remove_last_~last~0.base (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0))) (<= 0 dll_remove_last_~snd_to_last~0.offset)) [2019-10-13 22:56:50,345 INFO L193 IcfgInterpreter]: Reachable states at location L599-1 satisfy 432#(and (<= dll_remove_last_~snd_to_last~0.offset 0) (<= 0 dll_remove_last_~head.offset) (<= dll_remove_last_~snd_to_last~0.base 0) (or (and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.offset) (= 0 |#NULL.base|) (= dll_remove_last_~snd_to_last~0.base 0) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.base) (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) |dll_remove_last_#t~mem10.offset|) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (not (= |dll_remove_last_#in~head.base| 0)) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) |dll_remove_last_#t~mem10.base|) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)))) (= |#memory_int| |old(#memory_int)|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.offset) (= 0 |#NULL.base|) (= dll_remove_last_~snd_to_last~0.base 0) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset) dll_remove_last_~last~0.base) (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) |dll_remove_last_#t~mem10.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)))) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (not (= |dll_remove_last_#in~head.base| 0)) (= (select (select |#memory_$Pointer$.base| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) |dll_remove_last_#t~mem10.base|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= dll_remove_last_~head.offset 0) (<= 0 dll_remove_last_~snd_to_last~0.base) (<= 0 |dll_remove_last_#in~head.offset|) (<= 0 dll_remove_last_~snd_to_last~0.offset)) [2019-10-13 22:56:50,345 INFO L193 IcfgInterpreter]: Reachable states at location L578-1 satisfy 404#(and (<= 0 dll_create_~len) (or (and (= (select |#length| |dll_create_#t~malloc3.base|) 12) (not (= 0 |dll_create_#t~malloc3.base|)) (= dll_create_~new_head~0.base |dll_create_#t~malloc3.base|) (< 0 dll_create_~len) (not (= dll_create_~new_head~0.base 0)) (= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| dll_create_~new_head~0.offset) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (< |#StackHeapBarrier| |dll_create_#t~malloc3.base|)) (and (= (select |#length| |dll_create_#t~malloc3.base|) 12) (not (= 0 |dll_create_#t~malloc3.base|)) (= dll_create_~new_head~0.base |dll_create_#t~malloc3.base|) (< 0 dll_create_~len) (= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| dll_create_~new_head~0.offset) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (< |#StackHeapBarrier| |dll_create_#t~malloc3.base|) (not (= 0 dll_create_~new_head~0.offset)))) (<= |dll_create_#t~malloc3.offset| 0) (<= dll_create_~new_head~0.offset 0) (<= 0 dll_create_~new_head~0.offset) (<= 0 |dll_create_#t~malloc3.offset|)) [2019-10-13 22:56:50,347 INFO L193 IcfgInterpreter]: Reachable states at location L578 satisfy 399#(and (<= 0 dll_create_~len) (not (= 0 |dll_create_#t~malloc3.base|)) (= dll_create_~new_head~0.base |dll_create_#t~malloc3.base|) (< 0 dll_create_~len) (<= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| dll_create_~new_head~0.offset) (= (select |#length| |dll_create_#t~malloc3.base|) 12) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (<= dll_create_~new_head~0.offset 0) (< |#StackHeapBarrier| |dll_create_#t~malloc3.base|) (<= 0 dll_create_~new_head~0.offset) (<= 0 |dll_create_#t~malloc3.offset|)) [2019-10-13 22:56:50,347 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 408#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:50,347 INFO L193 IcfgInterpreter]: Reachable states at location dll_remove_lastENTRY satisfy 417#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= |#valid| |old(#valid)|) (<= 0 |dll_remove_last_#in~head.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= 0 |dll_remove_last_#in~head.offset|) (= |#NULL.offset| 0) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:50,347 INFO L193 IcfgInterpreter]: Reachable states at location L616 satisfy 232#false [2019-10-13 22:56:50,348 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 170#false [2019-10-13 22:56:50,348 INFO L193 IcfgInterpreter]: Reachable states at location L576-2 satisfy 389#true [2019-10-13 22:56:50,348 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 413#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:50,348 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:50,350 INFO L193 IcfgInterpreter]: Reachable states at location L593-2 satisfy 442#(and (<= dll_remove_last_~snd_to_last~0.offset 0) (<= 0 dll_remove_last_~head.offset) (<= dll_remove_last_~snd_to_last~0.base 0) (<= dll_remove_last_~head.offset 0) (<= 0 dll_remove_last_~snd_to_last~0.base) (or (and (= 0 |#NULL.base|) (= (store |old(#memory_int)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_int)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) (select (select |#memory_int| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4)))) |#memory_int|) (= dll_remove_last_~snd_to_last~0.base 0) (= |#valid| (store |old(#valid)| dll_remove_last_~last~0.base 0)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)) 0)) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (= dll_remove_last_~last~0.offset (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (= 0 (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4))) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= (store |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0))) (<= 0 |dll_remove_last_#in~head.offset|) (= dll_remove_last_~last~0.base (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0)) (and (= 0 |#NULL.base|) (= (store |old(#memory_int)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_int)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) (select (select |#memory_int| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4)))) |#memory_int|) (= dll_remove_last_~snd_to_last~0.base 0) (= |#valid| (store |old(#valid)| dll_remove_last_~last~0.base 0)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= 0 |dll_remove_last_#in~head.offset|) (< |dll_remove_last_#in~head.base| |#StackHeapBarrier|) (not (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset) 4)) 0)) (= dll_remove_last_~last~0.offset (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (= dll_remove_last_~snd_to_last~0.offset 0) (<= |#NULL.base| 0) (<= |dll_remove_last_#in~head.offset| 0) (<= 0 (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|)) (= 0 (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4))) (<= |#NULL.offset| 0) (not (= |dll_remove_last_#in~head.base| 0)) (= (store |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base (store (select |old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0))) (<= 0 |dll_remove_last_#in~head.offset|) (= dll_remove_last_~last~0.base (select (select |old(#memory_$Pointer$.base)| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (<= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_last_#in~head.base|) |dll_remove_last_#in~head.offset|) 0) (= |#NULL.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_last_~last~0.base) (+ dll_remove_last_~last~0.offset 4)) 0))) (<= 0 dll_remove_last_~snd_to_last~0.offset)) [2019-10-13 22:56:50,350 INFO L193 IcfgInterpreter]: Reachable states at location dll_createENTRY satisfy 356#(exists ((|v_main_~#s~0.base_BEFORE_CALL_20| Int)) (and (= (select |old(#valid)| |v_main_~#s~0.base_BEFORE_CALL_20|) 1) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 4 (select |old(#length)| |v_main_~#s~0.base_BEFORE_CALL_20|)) (= 2 |dll_create_#in~len|) (< |v_main_~#s~0.base_BEFORE_CALL_20| |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (not (= 0 |v_main_~#s~0.base_BEFORE_CALL_20|)) (= |dll_create_#in~data| 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2019-10-13 22:56:50,350 INFO L193 IcfgInterpreter]: Reachable states at location L610 satisfy 38#(and (< |main_~#s~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#s~0.base| 1)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| |main_~#s~0.base|)) (<= 0 |main_~#s~0.offset|) (= main_~data~0 1) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= |main_~#s~0.offset| 0) (= |main_~#s~0.offset| 0) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |old(#length)| |main_~#s~0.base| 4) |#length|) (= |#NULL.offset| 0) (not (= |main_~#s~0.base| 0)) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:50,351 INFO L193 IcfgInterpreter]: Reachable states at location L612-2 satisfy 351#(and (< |main_~#s~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| |main_~#s~0.base|)) (<= 0 |main_~#s~0.offset|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= |main_~#s~0.offset| 0) (<= 1 main_~i~0) (= main_~i~0 (+ main_~len~0 (- 1))) (= |main_~#s~0.offset| 0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (not (= |main_~#s~0.base| 0)) (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-13 22:56:50,351 INFO L193 IcfgInterpreter]: Reachable states at location L610-1 satisfy 94#(and (< |main_~#s~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| |main_~#s~0.base|)) (<= 0 |main_~#s~0.offset|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= |main_~#s~0.offset| 0) (= |main_~#s~0.offset| 0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (not (= |main_~#s~0.base| 0)) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-13 22:56:51,300 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-13 22:56:51,718 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-13 22:56:52,192 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-10-13 22:56:52,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 22:56:52,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [9, 6, 6] total 25 [2019-10-13 22:56:52,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954833001] [2019-10-13 22:56:52,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 22:56:52,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 22:56:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-10-13 22:56:52,210 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2019-10-13 22:56:53,023 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-13 22:56:53,368 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-10-13 22:56:53,763 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-10-13 22:56:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:53,939 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-10-13 22:56:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 22:56:53,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-13 22:56:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:53,943 INFO L225 Difference]: With dead ends: 48 [2019-10-13 22:56:53,943 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 22:56:53,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 22:56:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 22:56:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-13 22:56:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 22:56:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-13 22:56:53,952 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2019-10-13 22:56:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:53,952 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-13 22:56:53,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 22:56:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-13 22:56:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 22:56:53,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:53,955 INFO L380 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] [2019-10-13 22:56:54,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:54,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1313247650, now seen corresponding path program 1 times [2019-10-13 22:56:54,161 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:54,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030770009] [2019-10-13 22:56:54,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:54,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:54,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:56:54,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030770009] [2019-10-13 22:56:54,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680388786] [2019-10-13 22:56:54,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:54,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 22:56:54,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 22:56:54,399 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 22:56:54,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [181474823] [2019-10-13 22:56:54,478 INFO L162 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-10-13 22:56:54,478 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:54,479 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:54,479 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:54,479 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:54,511 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:54,614 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:54,886 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:55,270 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:55,587 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:55,599 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:55,645 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:55,682 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:57,769 INFO L199 IcfgInterpreter]: Interpreting procedure dll_create with input of size 44 for LOIs [2019-10-13 22:57:02,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:02,989 INFO L199 IcfgInterpreter]: Interpreting procedure dll_remove_last with input of size 13 for LOIs [2019-10-13 22:57:03,069 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:03,070 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:03,070 INFO L193 IcfgInterpreter]: Reachable states at location L599-3 satisfy 772#true [2019-10-13 22:57:03,070 INFO L193 IcfgInterpreter]: Reachable states at location L599-4 satisfy 754#true [2019-10-13 22:57:03,070 INFO L193 IcfgInterpreter]: Reachable states at location L615 satisfy 515#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem13.offset|) (not (<= 0 main_~i~0)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem13.base|) (<= main_~i~0 0)) [2019-10-13 22:57:03,070 INFO L193 IcfgInterpreter]: Reachable states at location L593 satisfy 715#(and (= (select (select |#memory_$Pointer$.offset| dll_remove_last_~head.base) dll_remove_last_~head.offset) |dll_remove_last_#t~mem5.offset|) (= |#valid| |old(#valid)|) (= |dll_remove_last_#t~mem5.base| (select (select |#memory_$Pointer$.base| dll_remove_last_~head.base) dll_remove_last_~head.offset)) (= (select (select |#memory_$Pointer$.base| |dll_remove_last_#t~mem5.base|) (+ |dll_remove_last_#t~mem5.offset| 4)) |dll_remove_last_#t~mem6.base|) (= dll_remove_last_~head.offset |dll_remove_last_#in~head.offset|) (= |dll_remove_last_#in~head.base| dll_remove_last_~head.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |dll_remove_last_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |dll_remove_last_#t~mem5.base|) (+ |dll_remove_last_#t~mem5.offset| 4))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:57:03,071 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:03,071 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:57:03,071 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 582#(<= 0 main_~i~0) [2019-10-13 22:57:03,071 INFO L193 IcfgInterpreter]: Reachable states at location dll_createEXIT satisfy 687#(and (= |dll_create_#res.base| dll_create_~head~0.base) (= |dll_create_#res.offset| dll_create_~head~0.offset) (not (< 0 dll_create_~len)) (<= dll_create_~len 0)) [2019-10-13 22:57:03,071 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 448#(or (exists ((v_dll_remove_last_~last~0.base_BEFORE_RETURN_26 Int) (v_dll_remove_last_~snd_to_last~0.base_BEFORE_RETURN_26 Int) (v_dll_remove_last_~snd_to_last~0.offset_BEFORE_RETURN_26 Int)) (and (<= 0 main_~i~0) (= (select (select |#memory_$Pointer$.offset| v_dll_remove_last_~snd_to_last~0.base_BEFORE_RETURN_26) (+ v_dll_remove_last_~snd_to_last~0.offset_BEFORE_RETURN_26 4)) 0) (= (select (select |#memory_$Pointer$.base| v_dll_remove_last_~snd_to_last~0.base_BEFORE_RETURN_26) (+ v_dll_remove_last_~snd_to_last~0.offset_BEFORE_RETURN_26 4)) 0) (= (select |#valid| v_dll_remove_last_~last~0.base_BEFORE_RETURN_26) 0))) (exists ((v_dll_remove_last_~last~0.base_BEFORE_RETURN_25 Int) (v_dll_remove_last_~snd_to_last~0.base_BEFORE_RETURN_25 Int) (v_dll_remove_last_~snd_to_last~0.offset_BEFORE_RETURN_25 Int)) (and (= 0 (select (select |#memory_$Pointer$.base| v_dll_remove_last_~snd_to_last~0.base_BEFORE_RETURN_25) (+ v_dll_remove_last_~snd_to_last~0.offset_BEFORE_RETURN_25 4))) (<= 0 main_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| v_dll_remove_last_~snd_to_last~0.base_BEFORE_RETURN_25) (+ v_dll_remove_last_~snd_to_last~0.offset_BEFORE_RETURN_25 4))) (= (select |#valid| v_dll_remove_last_~last~0.base_BEFORE_RETURN_25) 0)))) [2019-10-13 22:57:03,072 INFO L193 IcfgInterpreter]: Reachable states at location dll_remove_lastEXIT satisfy 764#(and (= (select (select |#memory_$Pointer$.base| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4))) (= (select |#valid| dll_remove_last_~last~0.base) 0)) [2019-10-13 22:57:03,072 INFO L193 IcfgInterpreter]: Reachable states at location L599-1 satisfy 749#true [2019-10-13 22:57:03,072 INFO L193 IcfgInterpreter]: Reachable states at location L578-1 satisfy 697#(and (<= 0 dll_create_~len) (or (and (= (select |#length| |dll_create_#t~malloc3.base|) 12) (not (= 0 |dll_create_#t~malloc3.base|)) (= dll_create_~new_head~0.base |dll_create_#t~malloc3.base|) (< 0 dll_create_~len) (not (= dll_create_~new_head~0.base 0)) (= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| dll_create_~new_head~0.offset) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (< |#StackHeapBarrier| |dll_create_#t~malloc3.base|)) (and (= (select |#length| |dll_create_#t~malloc3.base|) 12) (not (= 0 |dll_create_#t~malloc3.base|)) (= dll_create_~new_head~0.base |dll_create_#t~malloc3.base|) (< 0 dll_create_~len) (= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| dll_create_~new_head~0.offset) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (< |#StackHeapBarrier| |dll_create_#t~malloc3.base|) (not (= 0 dll_create_~new_head~0.offset)))) (<= |dll_create_#t~malloc3.offset| 0) (<= dll_create_~new_head~0.offset 0) (<= 0 dll_create_~new_head~0.offset) (<= 0 |dll_create_#t~malloc3.offset|)) [2019-10-13 22:57:03,072 INFO L193 IcfgInterpreter]: Reachable states at location L578 satisfy 692#(and (<= 0 dll_create_~len) (not (= 0 |dll_create_#t~malloc3.base|)) (= dll_create_~new_head~0.base |dll_create_#t~malloc3.base|) (< 0 dll_create_~len) (<= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| 0) (= |dll_create_#t~malloc3.offset| dll_create_~new_head~0.offset) (= (select |#length| |dll_create_#t~malloc3.base|) 12) (= 1 (select |#valid| |dll_create_#t~malloc3.base|)) (<= dll_create_~new_head~0.offset 0) (< |#StackHeapBarrier| |dll_create_#t~malloc3.base|) (<= 0 dll_create_~new_head~0.offset) (<= 0 |dll_create_#t~malloc3.offset|)) [2019-10-13 22:57:03,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 701#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:03,073 INFO L193 IcfgInterpreter]: Reachable states at location dll_remove_lastENTRY satisfy 710#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:57:03,073 INFO L193 IcfgInterpreter]: Reachable states at location L616 satisfy 369#(and (or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (<= 0 main_~i~0))) (and (not (<= 0 main_~i~0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0)))) (<= main_~i~0 0)) [2019-10-13 22:57:03,073 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 229#(and (or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (<= 0 main_~i~0))) (and (not (<= 0 main_~i~0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0)))) (<= main_~i~0 0)) [2019-10-13 22:57:03,073 INFO L193 IcfgInterpreter]: Reachable states at location L576-2 satisfy 682#true [2019-10-13 22:57:03,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 706#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:57:03,074 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:03,074 INFO L193 IcfgInterpreter]: Reachable states at location L593-2 satisfy 759#(and (= (select (select |#memory_$Pointer$.base| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4))) (= (select |#valid| dll_remove_last_~last~0.base) 0)) [2019-10-13 22:57:03,074 INFO L193 IcfgInterpreter]: Reachable states at location dll_createENTRY satisfy 649#(exists ((|v_main_~#s~0.base_BEFORE_CALL_68| Int)) (and (= (select |old(#valid)| |v_main_~#s~0.base_BEFORE_CALL_68|) 1) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |v_main_~#s~0.base_BEFORE_CALL_68| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (= 2 |dll_create_#in~len|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (not (= 0 |v_main_~#s~0.base_BEFORE_CALL_68|)) (= |dll_create_#in~data| 1) (= 4 (select |old(#length)| |v_main_~#s~0.base_BEFORE_CALL_68|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2019-10-13 22:57:03,074 INFO L193 IcfgInterpreter]: Reachable states at location L610 satisfy 38#(and (< |main_~#s~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#s~0.base| 1)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| |main_~#s~0.base|)) (<= 0 |main_~#s~0.offset|) (= main_~data~0 1) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= |main_~#s~0.offset| 0) (= |main_~#s~0.offset| 0) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |old(#length)| |main_~#s~0.base| 4) |#length|) (= |#NULL.offset| 0) (not (= |main_~#s~0.base| 0)) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:57:03,075 INFO L193 IcfgInterpreter]: Reachable states at location L612-2 satisfy 644#true [2019-10-13 22:57:03,075 INFO L193 IcfgInterpreter]: Reachable states at location L610-1 satisfy 94#(and (< |main_~#s~0.base| |#StackHeapBarrier|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| |main_~#s~0.base|)) (<= 0 |main_~#s~0.offset|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= |main_~#s~0.offset| 0) (= |main_~#s~0.offset| 0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (not (= |main_~#s~0.base| 0)) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-13 22:57:03,812 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:03,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 17] total 27 [2019-10-13 22:57:03,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369892776] [2019-10-13 22:57:03,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 22:57:03,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:03,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 22:57:03,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=625, Unknown=1, NotChecked=0, Total=702 [2019-10-13 22:57:03,815 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 27 states. [2019-10-13 22:57:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:05,243 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-13 22:57:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 22:57:05,244 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-10-13 22:57:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:05,245 INFO L225 Difference]: With dead ends: 61 [2019-10-13 22:57:05,246 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 22:57:05,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=227, Invalid=1934, Unknown=1, NotChecked=0, Total=2162 [2019-10-13 22:57:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 22:57:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-13 22:57:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 22:57:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-13 22:57:05,261 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 28 [2019-10-13 22:57:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:05,262 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-13 22:57:05,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 22:57:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-13 22:57:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 22:57:05,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:05,264 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 22:57:05,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:05,489 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1145109181, now seen corresponding path program 2 times [2019-10-13 22:57:05,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:05,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390272376] [2019-10-13 22:57:05,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:05,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:05,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:57:06,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390272376] [2019-10-13 22:57:06,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851574094] [2019-10-13 22:57:06,241 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:06,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 22:57:06,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:06,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-13 22:57:06,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 22:57:06,711 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 22:57:06,861 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:57:06,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [17] total 24 [2019-10-13 22:57:06,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760731741] [2019-10-13 22:57:06,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 22:57:06,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:06,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 22:57:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-10-13 22:57:06,863 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2019-10-13 22:57:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:07,183 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-13 22:57:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:57:07,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-10-13 22:57:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:07,186 INFO L225 Difference]: With dead ends: 52 [2019-10-13 22:57:07,186 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 22:57:07,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2019-10-13 22:57:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 22:57:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-10-13 22:57:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-13 22:57:07,194 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 41 [2019-10-13 22:57:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:07,194 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-13 22:57:07,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 22:57:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-13 22:57:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 22:57:07,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:07,196 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-13 22:57:07,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:07,400 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash -483568520, now seen corresponding path program 3 times [2019-10-13 22:57:07,401 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:07,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101688615] [2019-10-13 22:57:07,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:07,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:07,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:08,085 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-10-13 22:57:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:57:08,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101688615] [2019-10-13 22:57:08,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168912724] [2019-10-13 22:57:08,415 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:08,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:57:08,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:08,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-13 22:57:08,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:17,274 WARN L191 SmtUtils]: Spent 5.43 s on a formula simplification that was a NOOP. DAG size: 34