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/heap-data/hash_fun.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:57:18,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:57:18,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:57:18,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:57:18,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:57:18,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:57:18,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:57:18,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:57:18,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:57:18,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:57:18,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:57:18,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:57:18,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:57:18,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:57:18,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:57:18,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:57:18,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:57:18,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:57:18,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:57:18,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:57:18,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:57:18,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:57:18,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:57:18,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:57:18,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:57:18,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:57:18,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:57:18,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:57:18,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:57:18,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:57:18,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:57:18,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:57:18,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:57:18,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:57:18,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:57:18,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:57:18,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:57:18,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:57:18,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:57:18,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:57:18,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:57:18,664 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 21:57:18,678 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:57:18,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:57:18,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:57:18,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:57:18,680 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:57:18,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:57:18,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:57:18,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:57:18,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:57:18,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:57:18,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:57:18,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:57:18,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:57:18,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:57:18,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:57:18,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:57:18,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:57:18,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:57:18,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:57:18,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:57:18,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:57:18,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:57:18,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:57:18,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:57:18,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:57:18,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:57:18,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:57:18,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:57:18,685 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 21:57:19,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:57:19,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:57:19,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:57:19,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:57:19,058 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:57:19,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/hash_fun.i [2019-10-13 21:57:19,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa38da0af/78bfc1baebd5486a9eeadbd680a4e647/FLAG432f2728f [2019-10-13 21:57:19,713 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:57:19,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/hash_fun.i [2019-10-13 21:57:19,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa38da0af/78bfc1baebd5486a9eeadbd680a4e647/FLAG432f2728f [2019-10-13 21:57:20,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa38da0af/78bfc1baebd5486a9eeadbd680a4e647 [2019-10-13 21:57:20,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:57:20,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:57:20,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:57:20,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:57:20,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:57:20,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7183b207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20, skipping insertion in model container [2019-10-13 21:57:20,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,042 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:57:20,088 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:57:20,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:57:20,616 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:57:20,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:57:20,745 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:57:20,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20 WrapperNode [2019-10-13 21:57:20,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:57:20,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:57:20,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:57:20,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:57:20,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (1/1) ... [2019-10-13 21:57:20,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:57:20,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:57:20,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:57:20,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:57:20,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (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 21:57:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:57:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:57:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 21:57:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 21:57:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_fun [2019-10-13 21:57:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2019-10-13 21:57:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:57:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:57:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:57:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 21:57:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 21:57:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 21:57:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 21:57:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 21:57:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 21:57:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 21:57:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 21:57:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 21:57:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 21:57:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 21:57:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 21:57:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 21:57:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 21:57:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 21:57:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 21:57:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 21:57:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 21:57:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 21:57:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 21:57:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 21:57:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 21:57:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 21:57:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 21:57:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 21:57:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 21:57:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 21:57:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 21:57:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 21:57:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 21:57:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 21:57:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 21:57:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 21:57:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 21:57:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 21:57:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 21:57:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 21:57:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 21:57:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 21:57:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 21:57:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 21:57:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 21:57:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 21:57:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 21:57:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 21:57:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 21:57:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:57:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:57:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 21:57:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:57:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 21:57:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 21:57:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 21:57:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 21:57:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 21:57:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 21:57:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 21:57:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 21:57:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 21:57:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:57:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 21:57:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 21:57:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 21:57:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 21:57:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 21:57:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 21:57:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 21:57:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 21:57:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 21:57:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 21:57:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 21:57:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 21:57:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 21:57:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 21:57:20,894 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure hash_fun [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:57:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:57:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:57:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 21:57:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:57:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:57:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:57:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:57:21,513 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:57:21,513 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:57:21,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:21 BoogieIcfgContainer [2019-10-13 21:57:21,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:57:21,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:57:21,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:57:21,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:57:21,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:20" (1/3) ... [2019-10-13 21:57:21,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6636b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:21, skipping insertion in model container [2019-10-13 21:57:21,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:20" (2/3) ... [2019-10-13 21:57:21,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6636b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:21, skipping insertion in model container [2019-10-13 21:57:21,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:21" (3/3) ... [2019-10-13 21:57:21,524 INFO L109 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2019-10-13 21:57:21,534 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:57:21,543 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:57:21,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:57:21,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:57:21,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:57:21,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:57:21,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:57:21,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:57:21,578 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:57:21,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:57:21,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:57:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-13 21:57:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:57:21,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:21,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:21,607 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:21,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:21,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1208309427, now seen corresponding path program 1 times [2019-10-13 21:57:21,620 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:21,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233447826] [2019-10-13 21:57:21,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:21,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:21,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:21,757 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 21:57:21,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233447826] [2019-10-13 21:57:21,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:21,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:57:21,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902574995] [2019-10-13 21:57:21,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:57:21,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:57:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:57:21,783 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-13 21:57:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:21,807 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-10-13 21:57:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:57:21,809 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 21:57:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:21,821 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:57:21,822 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:57:21,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:57:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:57:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:57:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:57:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-13 21:57:21,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2019-10-13 21:57:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:21,863 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-13 21:57:21,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:57:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-13 21:57:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 21:57:21,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:21,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:21,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1850516525, now seen corresponding path program 1 times [2019-10-13 21:57:21,866 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:21,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564360795] [2019-10-13 21:57:21,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:21,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:21,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:21,979 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 21:57:21,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564360795] [2019-10-13 21:57:21,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:21,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:57:21,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223278693] [2019-10-13 21:57:21,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:57:21,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:57:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:57:21,984 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2019-10-13 21:57:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:22,066 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-13 21:57:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:57:22,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 21:57:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:22,068 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:57:22,068 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 21:57:22,069 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 21:57:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 21:57:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-13 21:57:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:57:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-10-13 21:57:22,081 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2019-10-13 21:57:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:22,081 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-10-13 21:57:22,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:57:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-10-13 21:57:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:57:22,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:22,084 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] [2019-10-13 21:57:22,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1555299807, now seen corresponding path program 1 times [2019-10-13 21:57:22,085 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:22,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806113631] [2019-10-13 21:57:22,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:22,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:22,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:22,351 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 21:57:22,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806113631] [2019-10-13 21:57:22,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49428500] [2019-10-13 21:57:22,352 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 21:57:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:22,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 21:57:22,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:57:22,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 21:57:22,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:22,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:22,718 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-13 21:57:22,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2019-10-13 21:57:22,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-13 21:57:22,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:22,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 21:57:22,743 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:22,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:22,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:22,760 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:41 [2019-10-13 21:57:22,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:22,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:22,853 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 21:57:22,853 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:57:22,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:22,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:22,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:22,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:23,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:23,079 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_28|], 2=[|v_#memory_int_29|]} [2019-10-13 21:57:23,136 INFO L341 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2019-10-13 21:57:23,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2019-10-13 21:57:23,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:23,198 INFO L341 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2019-10-13 21:57:23,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2019-10-13 21:57:23,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:23,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:23,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-10-13 21:57:23,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:23,238 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:23,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-10-13 21:57:23,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:23,252 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:23,294 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-10-13 21:57:23,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:23,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-13 21:57:23,298 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:16 [2019-10-13 21:57:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:23,369 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_int_30|]} [2019-10-13 21:57:23,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:57:23,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2019-10-13 21:57:23,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:23,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:23,386 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_30| vanished before elimination [2019-10-13 21:57:23,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:23,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:1 [2019-10-13 21:57:23,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:23,411 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 21:57:23,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1261210934] [2019-10-13 21:57:23,437 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:57:23,437 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:57:23,443 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:57:23,451 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:57:23,452 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:57:23,598 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:57:37,108 INFO L199 IcfgInterpreter]: Interpreting procedure append_to_list with input of size 47 for LOIs [2019-10-13 21:57:37,150 INFO L199 IcfgInterpreter]: Interpreting procedure hash_fun with input of size 36 for LOIs [2019-10-13 21:57:37,154 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:57:37,156 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:57:37,157 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:57:37,157 INFO L193 IcfgInterpreter]: Reachable states at location append_to_listENTRY satisfy 1565#(and (<= 0 |append_to_list_#in~hash|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 (+ |append_to_list_#in~hash| 2147483648)) (< |append_to_list_#in~list.base| |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 |append_to_list_#in~hash|) (= |append_to_list_#in~list.offset| 0) (<= |append_to_list_#in~hash| 2147483647) (<= |append_to_list_#in~list.offset| 0) (<= |append_to_list_#in~hash| 1000100) (= |#valid| |old(#valid)|) (not (= 0 |append_to_list_#in~list.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 |append_to_list_#in~list.offset|) (= |#NULL.offset| 0) (<= |append_to_list_#in~hash| 1000099) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 21:57:37,157 INFO L193 IcfgInterpreter]: Reachable states at location L579-2 satisfy 1145#(and (or (and (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_~#list~0.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-13 21:57:37,157 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1583#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:57:37,158 INFO L193 IcfgInterpreter]: Reachable states at location L580-2 satisfy 741#(and (= |#NULL.base| 0) (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 1000000) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~hash~0 1000100)) [2019-10-13 21:57:37,158 INFO L193 IcfgInterpreter]: Reachable states at location hash_funEXIT satisfy 1579#(exists ((v_prenex_26 Int)) (or (and (<= 0 (+ |hash_fun_#res| 2147483648)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |hash_fun_#res| 2147483647) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 0 (+ |hash_fun_#res| 2147483648)) (= (select (select |#memory_$Pointer$.offset| v_prenex_26) 0) 0) (= 0 |#NULL.base|) (not (= 0 v_prenex_26)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< v_prenex_26 |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_26) 0)) (<= |hash_fun_#res| 2147483647) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= 4 (select |#length| v_prenex_26)) (= (select |#valid| v_prenex_26) 1)))) [2019-10-13 21:57:37,158 INFO L193 IcfgInterpreter]: Reachable states at location L579 satisfy 948#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#NULL.offset| 0) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-13 21:57:37,158 INFO L193 IcfgInterpreter]: Reachable states at location L571-1 satisfy 1332#(and (or (and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= 0 |#NULL.base|) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= |main_#t~nondet6| 2147483647) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (<= |main_~#list~0.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (<= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= main_~hash~0 1000100) (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= |main_#t~nondet6| 2147483647) (<= main_~hash~0 2147483647) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-13 21:57:37,159 INFO L193 IcfgInterpreter]: Reachable states at location L581 satisfy 399#(and (= |#NULL.base| 0) (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 1000000) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~hash~0 1000100)) [2019-10-13 21:57:37,159 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 21:57:37,159 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 21:57:37,159 INFO L193 IcfgInterpreter]: Reachable states at location L572-1 satisfy 1412#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-13 21:57:37,159 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1588#(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 21:57:37,160 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:57:37,160 INFO L193 IcfgInterpreter]: Reachable states at location L572 satisfy 1239#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-13 21:57:37,160 INFO L193 IcfgInterpreter]: Reachable states at location L574-1 satisfy 1561#(or (and (<= 0 |main_~#list~0.offset|) (<= |main_#t~ret7| 2147483647) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (<= 0 (+ |main_#t~ret7| 2147483648)) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~base~0 2147483647)) (and (<= 0 |main_~#list~0.offset|) (<= |main_#t~ret7| 2147483647) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (not (= |main_~#list~0.base| 0)) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 main_~base~0) (<= 0 (+ |main_#t~ret7| 2147483648)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#memory_int| |old(#memory_int)|) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= main_~base~0 2147483647))) [2019-10-13 21:57:37,160 INFO L193 IcfgInterpreter]: Reachable states at location hash_funENTRY satisfy 1574#(exists ((v_prenex_26 Int)) (or (and (= (select (select |#memory_$Pointer$.offset| v_prenex_26) 0) 0) (not (= 0 v_prenex_26)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< v_prenex_26 |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_26) 0)) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= 4 (select |#length| v_prenex_26)) (= (select |#valid| v_prenex_26) 1)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:57:37,161 INFO L193 IcfgInterpreter]: Reachable states at location append_to_listEXIT satisfy 1570#(exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (and (= 0 |#NULL.base|) (< |#StackHeapBarrier| |append_to_list_#t~malloc3.base|) (<= 0 |#NULL.base|) (= (store (store |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.offset)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_3)) append_to_list_~list.base (store (select (store |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.offset)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_3)) append_to_list_~list.base) append_to_list_~list.offset append_to_list_~node~0.offset)) |#memory_$Pointer$.offset|) (<= 0 (+ |append_to_list_#in~hash| 2147483648)) (= (select |old(#valid)| |append_to_list_#t~malloc3.base|) 0) (< |append_to_list_#in~list.base| |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= 1 |append_to_list_#in~hash|) (= |append_to_list_#in~list.offset| 0) (<= |append_to_list_#in~hash| 2147483647) (<= |append_to_list_#in~hash| 1000100) (= (store |old(#length)| |append_to_list_#t~malloc3.base| 8) |#length|) (= (store (store |old(#memory_int)| append_to_list_~node~0.base (store (store (select |old(#memory_int)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) v_DerPreprocessor_5) append_to_list_~node~0.offset append_to_list_~hash)) append_to_list_~list.base (store (select (store |old(#memory_int)| append_to_list_~node~0.base (store (store (select |old(#memory_int)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) v_DerPreprocessor_5) append_to_list_~node~0.offset append_to_list_~hash)) append_to_list_~list.base) append_to_list_~list.offset (select (select |#memory_int| append_to_list_~list.base) append_to_list_~list.offset))) |#memory_int|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.base)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_4)) append_to_list_~list.base (store (select (store |old(#memory_$Pointer$.base)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.base)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_4)) append_to_list_~list.base) append_to_list_~list.offset append_to_list_~node~0.base))) (<= 0 |append_to_list_#in~hash|) (= |append_to_list_#t~malloc3.offset| 0) (<= |#NULL.base| 0) (= |append_to_list_#t~malloc3.offset| append_to_list_~node~0.offset) (= |append_to_list_#in~hash| append_to_list_~hash) (= append_to_list_~list.base |append_to_list_#in~list.base|) (= |append_to_list_#in~list.offset| append_to_list_~list.offset) (= |append_to_list_#t~malloc3.base| append_to_list_~node~0.base) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| |append_to_list_#t~malloc3.base| 1)) (<= |append_to_list_#in~list.offset| 0) (not (= 0 |append_to_list_#in~list.base|)) (not (= |append_to_list_#t~malloc3.base| 0)) (<= 0 |append_to_list_#in~list.offset|) (= |#NULL.offset| 0) (<= |append_to_list_#in~hash| 1000099))) [2019-10-13 21:57:37,161 INFO L193 IcfgInterpreter]: Reachable states at location L574 satisfy 1047#(and (or (and (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#NULL.offset| 0) (<= main_~base~0 2147483647) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~base~0 2147483647))) (<= main_~base~0 1000000) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:57:37,161 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (= |#NULL.base| 0) (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 1000000) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~hash~0 1000100)) [2019-10-13 21:57:37,162 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 1486#(and (or (and (<= 0 |main_~#list~0.offset|) (<= main_~base~0 1000099) (= 0 |#NULL.base|) (<= 0 (+ main_~base~0 2147483747)) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (<= 0 (+ main_~base~0 99)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (<= 0 (+ main_~base~0 2147483648)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~base~0 2147483646) (= |#NULL.offset| 0) (<= main_~base~0 2147483647)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~base~0 2147483647))) (<= main_~hash~0 2147483647) (<= 0 |#NULL.base|) (<= 0 (+ main_~hash~0 2147483648)) (<= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:57:37,162 INFO L193 IcfgInterpreter]: Reachable states at location L576 satisfy 1549#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#memory_int| |old(#memory_int)|) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= main_~base~0 2147483647)) (and (<= 0 |main_~#list~0.offset|) (<= main_~base~0 1000099) (= 0 |#NULL.base|) (<= 0 (+ main_~base~0 2147483747)) (<= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (<= 0 (+ main_~base~0 99)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~base~0 2147483646) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= main_~base~0 2147483647))) (<= 0 main_~hash~0) (<= main_~hash~0 1000100) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:57:37,616 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-13 21:57:37,933 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-13 21:57:38,262 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-10-13 21:57:38,762 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-13 21:57:38,948 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 39 [2019-10-13 21:57:39,162 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-10-13 21:57:39,759 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-13 21:57:39,762 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:57:39,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 16] total 30 [2019-10-13 21:57:39,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164113084] [2019-10-13 21:57:39,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 21:57:39,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:39,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 21:57:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:57:39,767 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 30 states. [2019-10-13 21:57:40,061 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-13 21:57:40,315 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-10-13 21:57:40,557 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-13 21:57:41,033 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-13 21:57:41,776 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-10-13 21:57:42,075 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-10-13 21:57:42,429 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-10-13 21:57:42,687 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-10-13 21:57:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:43,035 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-13 21:57:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:57:43,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 22 [2019-10-13 21:57:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:43,038 INFO L225 Difference]: With dead ends: 76 [2019-10-13 21:57:43,039 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 21:57:43,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=396, Invalid=1860, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 21:57:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 21:57:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-10-13 21:57:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:57:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-13 21:57:43,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 22 [2019-10-13 21:57:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:43,050 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-13 21:57:43,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 21:57:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-13 21:57:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:57:43,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:43,051 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:43,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:57:43,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash -874488367, now seen corresponding path program 1 times [2019-10-13 21:57:43,258 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:43,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4671082] [2019-10-13 21:57:43,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:43,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:43,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:43,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4671082] [2019-10-13 21:57:43,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742170578] [2019-10-13 21:57:43,465 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 21:57:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:43,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-13 21:57:43,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:57:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:48,062 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:57:48,344 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-10-13 21:57:49,652 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-10-13 21:57:50,340 WARN L191 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-13 21:57:50,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-13 21:57:52,080 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 183 DAG size of output: 83 [2019-10-13 21:57:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:52,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [568834047] [2019-10-13 21:57:52,116 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 21:57:52,117 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:57:52,117 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:57:52,118 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:57:52,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:57:52,142 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs