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-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:54:46,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:54:46,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:54:46,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:54:46,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:54:46,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:54:46,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:54:46,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:54:46,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:54:46,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:54:46,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:54:46,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:54:46,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:54:46,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:54:46,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:54:46,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:54:46,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:54:46,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:54:46,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:54:46,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:54:46,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:54:46,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:54:46,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:54:46,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:54:46,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:54:46,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:54:46,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:54:46,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:54:46,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:54:46,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:54:46,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:54:46,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:54:46,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:54:46,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:54:46,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:54:46,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:54:46,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:54:46,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:54:46,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:54:46,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:54:46,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:54:46,721 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-07 03:54:46,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:54:46,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:54:46,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:54:46,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:54:46,737 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:54:46,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:54:46,737 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:54:46,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:54:46,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:54:46,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:54:46,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:54:46,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:54:46,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:54:46,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:54:46,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:54:46,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:54:46,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:54:46,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:54:46,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:54:46,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:54:46,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:54:46,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:54:46,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:54:46,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:54:46,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:54:46,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:54:46,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:54:46,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:54:46,743 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-07 03:54:47,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:54:47,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:54:47,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:54:47,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:54:47,099 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:54:47,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-07 03:54:47,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703580860/ed92669293424e12a31f4b538b0f90c8/FLAG544e0210c [2019-10-07 03:54:47,767 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:54:47,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-07 03:54:47,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703580860/ed92669293424e12a31f4b538b0f90c8/FLAG544e0210c [2019-10-07 03:54:48,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703580860/ed92669293424e12a31f4b538b0f90c8 [2019-10-07 03:54:48,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:54:48,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:54:48,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:54:48,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:54:48,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:54:48,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5f6572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48, skipping insertion in model container [2019-10-07 03:54:48,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:54:48,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:54:48,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:54:48,570 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:54:48,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:54:48,681 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:54:48,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48 WrapperNode [2019-10-07 03:54:48,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:54:48,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:54:48,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:54:48,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:54:48,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (1/1) ... [2019-10-07 03:54:48,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:54:48,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:54:48,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:54:48,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:54:48,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (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-07 03:54:48,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:54:48,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:54:48,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 03:54:48,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 03:54:48,830 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-07 03:54:48,831 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-10-07 03:54:48,832 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-10-07 03:54:48,832 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-10-07 03:54:48,832 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-10-07 03:54:48,833 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-10-07 03:54:48,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:54:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:54:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 03:54:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 03:54:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:54:48,834 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:54:48,837 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:54:48,837 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:54:48,837 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:54:48,837 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:54:48,837 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:54:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:54:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:54:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:54:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:54:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:54:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:54:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:54:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:54:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:54:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:54:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:54:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:54:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:54:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:54:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:54:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:54:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:54:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:54:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:54:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:54:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:54:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:54:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:54:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:54:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:54:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:54:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:54:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:54:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:54:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:54:48,847 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:54:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:54:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:54:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:54:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:54:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:54:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:54:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:54:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:54:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:54:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:54:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:54:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:54:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:54:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:54:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:54:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:54:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:54:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:54:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:54:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:54:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:54:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:54:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:54:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-10-07 03:54:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-10-07 03:54:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-10-07 03:54:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:54:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:54:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:54:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:54:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:54:49,929 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:54:49,929 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-10-07 03:54:49,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:49 BoogieIcfgContainer [2019-10-07 03:54:49,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:54:49,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:54:49,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:54:49,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:54:49,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:48" (1/3) ... [2019-10-07 03:54:49,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e713b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:49, skipping insertion in model container [2019-10-07 03:54:49,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:48" (2/3) ... [2019-10-07 03:54:49,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e713b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:49, skipping insertion in model container [2019-10-07 03:54:49,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:49" (3/3) ... [2019-10-07 03:54:49,939 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-07 03:54:49,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:54:49,961 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:54:49,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:54:50,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:54:50,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:54:50,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:54:50,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:54:50,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:54:50,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:54:50,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:54:50,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:54:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-10-07 03:54:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 03:54:50,024 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:50,025 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:54:50,027 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash 191183800, now seen corresponding path program 1 times [2019-10-07 03:54:50,041 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:50,041 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,041 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,041 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:50,171 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-07 03:54:50,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,172 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:50,173 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:54:50,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:54:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:54:50,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:54:50,194 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 2 states. [2019-10-07 03:54:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:50,274 INFO L93 Difference]: Finished difference Result 192 states and 327 transitions. [2019-10-07 03:54:50,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:54:50,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-07 03:54:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:50,299 INFO L225 Difference]: With dead ends: 192 [2019-10-07 03:54:50,299 INFO L226 Difference]: Without dead ends: 90 [2019-10-07 03:54:50,312 INFO L606 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-07 03:54:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-07 03:54:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-10-07 03:54:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-07 03:54:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-10-07 03:54:50,389 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 12 [2019-10-07 03:54:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:50,389 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-10-07 03:54:50,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:54:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-10-07 03:54:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:54:50,391 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:50,392 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:54:50,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1730894082, now seen corresponding path program 1 times [2019-10-07 03:54:50,393 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:50,394 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:50,489 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-07 03:54:50,489 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,490 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:50,490 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:54:50,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:54:50,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:54:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:54:50,492 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 3 states. [2019-10-07 03:54:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:50,528 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2019-10-07 03:54:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:54:50,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 03:54:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:50,531 INFO L225 Difference]: With dead ends: 175 [2019-10-07 03:54:50,531 INFO L226 Difference]: Without dead ends: 92 [2019-10-07 03:54:50,532 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:54:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-07 03:54:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-07 03:54:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-07 03:54:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-10-07 03:54:50,544 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 13 [2019-10-07 03:54:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:50,544 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-10-07 03:54:50,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:54:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-10-07 03:54:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:54:50,545 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:50,545 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:54:50,546 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash -677984875, now seen corresponding path program 1 times [2019-10-07 03:54:50,546 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:50,546 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,547 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,547 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:54:50,674 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,674 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:50,674 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:54:50,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:54:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:54:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:54:50,675 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 5 states. [2019-10-07 03:54:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:50,814 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2019-10-07 03:54:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:54:50,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-07 03:54:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:50,817 INFO L225 Difference]: With dead ends: 134 [2019-10-07 03:54:50,817 INFO L226 Difference]: Without dead ends: 129 [2019-10-07 03:54:50,817 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-07 03:54:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2019-10-07 03:54:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-07 03:54:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-10-07 03:54:50,832 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 15 [2019-10-07 03:54:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:50,832 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-10-07 03:54:50,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:54:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-10-07 03:54:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:54:50,833 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:50,833 INFO L385 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-07 03:54:50,834 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1566408483, now seen corresponding path program 1 times [2019-10-07 03:54:50,834 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:50,835 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:54:50,951 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:50,951 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:50,951 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:54:50,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:54:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:54:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:54:50,953 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 5 states. [2019-10-07 03:54:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:51,123 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2019-10-07 03:54:51,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:54:51,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-07 03:54:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:51,125 INFO L225 Difference]: With dead ends: 97 [2019-10-07 03:54:51,125 INFO L226 Difference]: Without dead ends: 94 [2019-10-07 03:54:51,126 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-07 03:54:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-07 03:54:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-07 03:54:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-10-07 03:54:51,137 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 22 [2019-10-07 03:54:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:51,137 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-10-07 03:54:51,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:54:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-10-07 03:54:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:54:51,138 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:51,139 INFO L385 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-07 03:54:51,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1891824473, now seen corresponding path program 1 times [2019-10-07 03:54:51,140 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:51,140 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:51,140 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:51,140 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:54:51,246 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:51,247 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:51,247 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:54:51,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:54:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:54:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:54:51,248 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 5 states. [2019-10-07 03:54:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:51,417 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-10-07 03:54:51,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:54:51,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-07 03:54:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:51,419 INFO L225 Difference]: With dead ends: 96 [2019-10-07 03:54:51,420 INFO L226 Difference]: Without dead ends: 93 [2019-10-07 03:54:51,420 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-07 03:54:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-10-07 03:54:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-07 03:54:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-10-07 03:54:51,431 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 22 [2019-10-07 03:54:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:51,431 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-10-07 03:54:51,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:54:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-10-07 03:54:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 03:54:51,433 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:51,433 INFO L385 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] [2019-10-07 03:54:51,433 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:51,434 INFO L82 PathProgramCache]: Analyzing trace with hash -231635343, now seen corresponding path program 1 times [2019-10-07 03:54:51,434 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:51,434 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:51,434 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:51,435 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:54:51,563 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:51,564 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:51,564 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:54:51,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:54:51,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:54:51,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:51,566 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 6 states. [2019-10-07 03:54:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:51,826 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2019-10-07 03:54:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:54:51,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-07 03:54:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:51,831 INFO L225 Difference]: With dead ends: 126 [2019-10-07 03:54:51,832 INFO L226 Difference]: Without dead ends: 123 [2019-10-07 03:54:51,833 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:54:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-07 03:54:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2019-10-07 03:54:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-07 03:54:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-10-07 03:54:51,847 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 25 [2019-10-07 03:54:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:51,847 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-10-07 03:54:51,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:54:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-10-07 03:54:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 03:54:51,848 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:51,849 INFO L385 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] [2019-10-07 03:54:51,849 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1018571824, now seen corresponding path program 1 times [2019-10-07 03:54:51,849 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:51,850 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:51,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:51,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:54:51,903 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:51,903 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:51,903 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:54:51,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:54:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:54:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:51,905 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 6 states. [2019-10-07 03:54:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:52,149 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-10-07 03:54:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:54:52,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-07 03:54:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:52,158 INFO L225 Difference]: With dead ends: 125 [2019-10-07 03:54:52,158 INFO L226 Difference]: Without dead ends: 122 [2019-10-07 03:54:52,159 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:54:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-07 03:54:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2019-10-07 03:54:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-07 03:54:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2019-10-07 03:54:52,169 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 25 [2019-10-07 03:54:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:52,170 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2019-10-07 03:54:52,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:54:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2019-10-07 03:54:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 03:54:52,171 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:52,171 INFO L385 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-07 03:54:52,171 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1202127690, now seen corresponding path program 1 times [2019-10-07 03:54:52,172 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:52,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:52,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:52,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:54:52,266 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:52,266 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:52,266 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:54:52,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:54:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:54:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:52,267 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 6 states. [2019-10-07 03:54:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:52,513 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2019-10-07 03:54:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:54:52,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-07 03:54:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:52,515 INFO L225 Difference]: With dead ends: 124 [2019-10-07 03:54:52,515 INFO L226 Difference]: Without dead ends: 121 [2019-10-07 03:54:52,516 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:54:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-07 03:54:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2019-10-07 03:54:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-07 03:54:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-10-07 03:54:52,526 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 28 [2019-10-07 03:54:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:52,526 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-10-07 03:54:52,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:54:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-10-07 03:54:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 03:54:52,528 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:52,528 INFO L385 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-07 03:54:52,528 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -551441676, now seen corresponding path program 1 times [2019-10-07 03:54:52,529 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:52,529 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:52,529 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:52,529 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:54:52,664 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:52,664 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:54:52,665 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:54:52,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:54:52,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:54:52,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:54:52,666 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 6 states. [2019-10-07 03:54:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:52,931 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2019-10-07 03:54:52,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:54:52,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-07 03:54:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:52,935 INFO L225 Difference]: With dead ends: 123 [2019-10-07 03:54:52,935 INFO L226 Difference]: Without dead ends: 120 [2019-10-07 03:54:52,936 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:54:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-07 03:54:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-10-07 03:54:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-07 03:54:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2019-10-07 03:54:52,944 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 28 [2019-10-07 03:54:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:52,944 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2019-10-07 03:54:52,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:54:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2019-10-07 03:54:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 03:54:52,945 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:52,946 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:54:52,946 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1639587553, now seen corresponding path program 1 times [2019-10-07 03:54:52,946 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:52,947 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:52,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:52,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:52,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:54:53,008 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:53,008 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:54:53,009 INFO L95 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-07 03:54:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:53,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 03:54:53,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:54:53,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:54:53,210 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 29 treesize of output 17 [2019-10-07 03:54:53,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:54:53,221 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 29 treesize of output 23 [2019-10-07 03:54:53,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:54:53,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:54:53,250 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 14 treesize of output 8 [2019-10-07 03:54:53,251 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:54:53,255 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 20 treesize of output 8 [2019-10-07 03:54:53,255 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:54:53,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:54:53,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-07 03:54:53,260 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:9 [2019-10-07 03:54:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:54:53,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:54:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:54:53,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:54:53,348 INFO L162 IcfgInterpreter]: Started Sifa with 30 locations of interest [2019-10-07 03:54:53,348 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:54:53,355 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:54:53,363 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:54:53,363 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:54:53,462 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:55:05,110 INFO L199 IcfgInterpreter]: Interpreting procedure inspect_before with input of size 8 for LOIs [2019-10-07 03:55:05,324 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:55:05,339 INFO L199 IcfgInterpreter]: Interpreting procedure fail with input of size 84 for LOIs [2019-10-07 03:55:05,351 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:55:05,351 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:55:05,352 INFO L193 IcfgInterpreter]: Reachable states at location L608 satisfy 248#true [2019-10-07 03:55:05,352 INFO L193 IcfgInterpreter]: Reachable states at location L628-1 satisfy 69#(and (<= 0 (+ |main_#t~nondet36| 2147483648)) (<= |main_#t~nondet36| 2147483647)) [2019-10-07 03:55:05,352 INFO L193 IcfgInterpreter]: Reachable states at location L628-3 satisfy 64#true [2019-10-07 03:55:05,352 INFO L193 IcfgInterpreter]: Reachable states at location inspect_beforeENTRY satisfy 84#(or (not (= 0 |inspect_before_#in~shape.offset|)) (not (= 0 |inspect_before_#in~shape.base|))) [2019-10-07 03:55:05,353 INFO L193 IcfgInterpreter]: Reachable states at location L608-3 satisfy 261#true [2019-10-07 03:55:05,353 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-07 03:55:05,353 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-07 03:55:05,353 INFO L193 IcfgInterpreter]: Reachable states at location L628-4 satisfy 74#true [2019-10-07 03:55:05,354 INFO L193 IcfgInterpreter]: Reachable states at location L607-3 satisfy 230#true [2019-10-07 03:55:05,354 INFO L193 IcfgInterpreter]: Reachable states at location L607-4 satisfy 216#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:05,354 INFO L193 IcfgInterpreter]: Reachable states at location L605-2 satisfy 313#true [2019-10-07 03:55:05,355 INFO L193 IcfgInterpreter]: Reachable states at location failENTRY satisfy 384#(exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_55 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_prenex_54 Int)) (or (and (not (= (select (select |#memory_$Pointer$.offset| v_prenex_55) (+ v_prenex_54 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| 0) 4)) (= (select (select |#memory_$Pointer$.base| v_prenex_55) (+ v_prenex_54 4)) 0) (not (= (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54) 0)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_55) (+ v_prenex_54 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54)) (select (select |#memory_$Pointer$.offset| v_prenex_55) v_prenex_54))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54)) (select (select |#memory_$Pointer$.offset| v_prenex_55) v_prenex_54))) (not (= 0 v_prenex_55)) (= 0 (select (select |#memory_$Pointer$.base| 0) 4))) (and (= (select (select |#memory_$Pointer$.base| v_prenex_46) (+ v_prenex_47 4)) 0) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_46) v_prenex_47)) (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_46) v_prenex_47)) (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47))) (= 0 (select (select |#memory_$Pointer$.offset| 0) 4)) (not (= 0 v_prenex_47)) (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_46) (+ v_prenex_47 4)))) (= 0 (select (select |#memory_$Pointer$.base| 0) 4)) (= (select (select |#memory_$Pointer$.offset| v_prenex_46) (+ v_prenex_47 4)) 0)) (and (not (= 0 v_prenex_48)) (= 0 (select (select |#memory_$Pointer$.offset| 0) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_48) v_prenex_49)) (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49) 0)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_48) v_prenex_49)) (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49))) (= 0 (select (select |#memory_$Pointer$.base| 0) 4)) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_48) (+ v_prenex_49 4))) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4)))))) [2019-10-07 03:55:05,355 INFO L193 IcfgInterpreter]: Reachable states at location L605-3 satisfy 318#true [2019-10-07 03:55:05,355 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 287#true [2019-10-07 03:55:05,356 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 375#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:55:05,356 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 361#true [2019-10-07 03:55:05,360 INFO L193 IcfgInterpreter]: Reachable states at location L607 satisfy 221#(or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= 0 inspect_before_~shape.base)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|)) (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= inspect_before_~shape.offset 0)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|))) [2019-10-07 03:55:05,361 INFO L193 IcfgInterpreter]: Reachable states at location L609-3 satisfy 300#true [2019-10-07 03:55:05,361 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 356#true [2019-10-07 03:55:05,361 INFO L193 IcfgInterpreter]: Reachable states at location L609-4 satisfy 274#true [2019-10-07 03:55:05,361 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 380#(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-07 03:55:05,362 INFO L193 IcfgInterpreter]: Reachable states at location L608-4 satisfy 239#true [2019-10-07 03:55:05,362 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:55:05,362 INFO L193 IcfgInterpreter]: Reachable states at location L606-3 satisfy 211#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:05,362 INFO L193 IcfgInterpreter]: Reachable states at location L643 satisfy 79#(or (not (= main_~data~0.base 0)) (not (= 0 main_~data~0.offset))) [2019-10-07 03:55:05,363 INFO L193 IcfgInterpreter]: Reachable states at location L606-4 satisfy 206#true [2019-10-07 03:55:05,363 INFO L193 IcfgInterpreter]: Reachable states at location L604-3 satisfy 98#true [2019-10-07 03:55:05,363 INFO L193 IcfgInterpreter]: Reachable states at location L611 satisfy 366#(and (<= inspect_before_~shape.offset 0) (= inspect_before_~shape.offset 0) (= 0 inspect_before_~shape.base) (<= 0 inspect_before_~shape.base) (<= inspect_before_~shape.base 0) (exists ((v_prenex_49 Int) (v_prenex_59 Int) (v_prenex_48 Int) (v_prenex_56 Int) (v_prenex_55 Int) (v_prenex_47 Int) (v_prenex_58 Int) (v_prenex_46 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_54 Int) (v_prenex_53 Int) (v_inspect_before_~shape.offset_21 Int) (v_prenex_50 Int) (v_inspect_before_~shape.base_21 Int)) (or (and (not (= (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_46) v_prenex_47)) (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47))) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_46) (+ v_prenex_47 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_46) v_prenex_47)) (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_46) (+ v_prenex_47 4))) (not (= 0 v_prenex_47)) (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_46) (+ v_prenex_47 4)))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_55) (+ v_prenex_54 4))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_55) (+ v_prenex_54 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54)) (select (select |#memory_$Pointer$.offset| v_prenex_55) v_prenex_54))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54)) (select (select |#memory_$Pointer$.offset| v_prenex_55) v_prenex_54))) (not (= 0 v_prenex_55)) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_55) (+ v_prenex_54 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (not (= 0 v_prenex_57)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_57) (+ v_prenex_56 4))) (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_57) (+ v_prenex_56 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_57) v_prenex_56)) (select (select |#memory_$Pointer$.offset| v_prenex_57) v_prenex_56))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_57) v_prenex_56)) (select (select |#memory_$Pointer$.offset| v_prenex_57) v_prenex_56))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_57) v_prenex_56) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_57) (+ v_prenex_56 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_21) v_inspect_before_~shape.offset_21)) (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_21) v_inspect_before_~shape.offset_21))) (not (= (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_21) v_inspect_before_~shape.offset_21) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_21) v_inspect_before_~shape.offset_21)) (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_21) v_inspect_before_~shape.offset_21))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_21) (+ v_inspect_before_~shape.offset_21 4))) (not (= (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_21) (+ v_inspect_before_~shape.offset_21 4)) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_21) (+ v_inspect_before_~shape.offset_21 4))) (not (= 0 v_inspect_before_~shape.offset_21)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_50) v_prenex_51)) (select (select |#memory_$Pointer$.offset| v_prenex_50) v_prenex_51))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_50) v_prenex_51) 0)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_50) (+ v_prenex_51 4))) (not (= 0 v_prenex_51)) (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_50) (+ v_prenex_51 4)))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_50) (+ v_prenex_51 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_50) v_prenex_51)) (select (select |#memory_$Pointer$.offset| v_prenex_50) v_prenex_51))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_59) (+ v_prenex_58 4)))) (not (= 0 v_prenex_59)) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_59) (+ v_prenex_58 4))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_59) v_prenex_58)) (select (select |#memory_$Pointer$.offset| v_prenex_59) v_prenex_58))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_59) v_prenex_58) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_59) v_prenex_58)) (select (select |#memory_$Pointer$.offset| v_prenex_59) v_prenex_58))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_59) (+ v_prenex_58 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_52) v_prenex_53)) (select (select |#memory_$Pointer$.offset| v_prenex_52) v_prenex_53))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_52) (+ v_prenex_53 4))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_52) (+ v_prenex_53 4)) 0)) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_52) (+ v_prenex_53 4))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_52) v_prenex_53)) (select (select |#memory_$Pointer$.offset| v_prenex_52) v_prenex_53))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_52) v_prenex_53) 0)) (not (= 0 v_prenex_53)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)) (and (not (= 0 v_prenex_48)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_48) v_prenex_49)) (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49) 0)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_48) v_prenex_49)) (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| v_prenex_48) (+ v_prenex_49 4))) (= inspect_before_~shape.offset (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) 0)))) (<= 0 inspect_before_~shape.offset)) [2019-10-07 03:55:05,364 INFO L193 IcfgInterpreter]: Reachable states at location L604-4 satisfy 89#(or (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.offset|))) (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.base|)))) [2019-10-07 03:55:05,364 INFO L193 IcfgInterpreter]: Reachable states at location failErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 389#(exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_55 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_prenex_54 Int)) (or (and (not (= (select (select |#memory_$Pointer$.offset| v_prenex_55) (+ v_prenex_54 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| 0) 4)) (= (select (select |#memory_$Pointer$.base| v_prenex_55) (+ v_prenex_54 4)) 0) (not (= (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54) 0)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_55) (+ v_prenex_54 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54)) (select (select |#memory_$Pointer$.offset| v_prenex_55) v_prenex_54))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_55) v_prenex_54)) (select (select |#memory_$Pointer$.offset| v_prenex_55) v_prenex_54))) (not (= 0 v_prenex_55)) (= 0 (select (select |#memory_$Pointer$.base| 0) 4))) (and (= (select (select |#memory_$Pointer$.base| v_prenex_46) (+ v_prenex_47 4)) 0) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_46) v_prenex_47)) (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_46) v_prenex_47)) (select (select |#memory_$Pointer$.offset| v_prenex_46) v_prenex_47))) (= 0 (select (select |#memory_$Pointer$.offset| 0) 4)) (not (= 0 v_prenex_47)) (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_46) (+ v_prenex_47 4)))) (= 0 (select (select |#memory_$Pointer$.base| 0) 4)) (= (select (select |#memory_$Pointer$.offset| v_prenex_46) (+ v_prenex_47 4)) 0)) (and (not (= 0 v_prenex_48)) (= 0 (select (select |#memory_$Pointer$.offset| 0) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_48) v_prenex_49)) (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49) 0)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_48) v_prenex_49)) (select (select |#memory_$Pointer$.offset| v_prenex_48) v_prenex_49))) (= 0 (select (select |#memory_$Pointer$.base| 0) 4)) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_48) (+ v_prenex_49 4))) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4)))))) [2019-10-07 03:55:05,641 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 03:55:05,641 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 15 [2019-10-07 03:55:05,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 03:55:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 03:55:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:55:05,643 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 12 states. [2019-10-07 03:55:06,189 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-07 03:55:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:55:06,989 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2019-10-07 03:55:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 03:55:06,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-07 03:55:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:55:06,992 INFO L225 Difference]: With dead ends: 130 [2019-10-07 03:55:06,992 INFO L226 Difference]: Without dead ends: 127 [2019-10-07 03:55:06,992 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-10-07 03:55:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-07 03:55:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2019-10-07 03:55:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-07 03:55:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2019-10-07 03:55:07,003 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 33 [2019-10-07 03:55:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:55:07,003 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2019-10-07 03:55:07,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 03:55:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2019-10-07 03:55:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 03:55:07,005 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:55:07,005 INFO L385 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:55:07,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:55:07,219 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:55:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:55:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1639596450, now seen corresponding path program 1 times [2019-10-07 03:55:07,219 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:55:07,220 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:07,220 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:07,220 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:55:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:55:07,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:07,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:55:07,321 INFO L95 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-07 03:55:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:07,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 03:55:07,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:55:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:55:07,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:55:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:55:07,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:55:07,546 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-07 03:55:07,546 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:55:07,546 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:55:07,547 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:55:07,547 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:55:07,578 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:55:14,678 INFO L199 IcfgInterpreter]: Interpreting procedure inspect_before with input of size 8 for LOIs [2019-10-07 03:55:14,779 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:55:14,783 INFO L199 IcfgInterpreter]: Interpreting procedure fail with input of size 1 for LOIs [2019-10-07 03:55:14,785 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:55:14,785 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:55:14,785 INFO L193 IcfgInterpreter]: Reachable states at location L608 satisfy 240#true [2019-10-07 03:55:14,786 INFO L193 IcfgInterpreter]: Reachable states at location L628-1 satisfy 69#(and (<= 0 (+ |main_#t~nondet36| 2147483648)) (<= |main_#t~nondet36| 2147483647)) [2019-10-07 03:55:14,786 INFO L193 IcfgInterpreter]: Reachable states at location L628-3 satisfy 64#true [2019-10-07 03:55:14,786 INFO L193 IcfgInterpreter]: Reachable states at location inspect_beforeENTRY satisfy 84#(or (not (= 0 |inspect_before_#in~shape.offset|)) (not (= 0 |inspect_before_#in~shape.base|))) [2019-10-07 03:55:14,786 INFO L193 IcfgInterpreter]: Reachable states at location L608-3 satisfy 253#true [2019-10-07 03:55:14,786 INFO L193 IcfgInterpreter]: Reachable states at location L606-1 satisfy 197#(and (<= inspect_before_~shape.offset 0) (= inspect_before_~shape.offset 0) (= 0 inspect_before_~shape.base) (<= 0 inspect_before_~shape.base) (<= inspect_before_~shape.base 0) (<= 0 inspect_before_~shape.offset)) [2019-10-07 03:55:14,787 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-07 03:55:14,787 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:55:14,787 INFO L193 IcfgInterpreter]: Reachable states at location L628-4 satisfy 74#true [2019-10-07 03:55:14,787 INFO L193 IcfgInterpreter]: Reachable states at location L607-3 satisfy 222#true [2019-10-07 03:55:14,787 INFO L193 IcfgInterpreter]: Reachable states at location L607-4 satisfy 208#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L605-2 satisfy 305#true [2019-10-07 03:55:14,788 INFO L193 IcfgInterpreter]: Reachable states at location failENTRY satisfy 337#true [2019-10-07 03:55:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L605-3 satisfy 310#true [2019-10-07 03:55:14,788 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 279#true [2019-10-07 03:55:14,788 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 328#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:55:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L607 satisfy 213#(or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= 0 inspect_before_~shape.base)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|)) (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= inspect_before_~shape.offset 0)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|))) [2019-10-07 03:55:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L609-3 satisfy 292#true [2019-10-07 03:55:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 324#true [2019-10-07 03:55:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L609-4 satisfy 266#true [2019-10-07 03:55:14,789 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 333#(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-07 03:55:14,789 INFO L193 IcfgInterpreter]: Reachable states at location L608-4 satisfy 231#true [2019-10-07 03:55:14,790 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:55:14,790 INFO L193 IcfgInterpreter]: Reachable states at location L606-3 satisfy 203#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:14,790 INFO L193 IcfgInterpreter]: Reachable states at location L643 satisfy 79#(or (not (= main_~data~0.base 0)) (not (= 0 main_~data~0.offset))) [2019-10-07 03:55:14,790 INFO L193 IcfgInterpreter]: Reachable states at location L606-4 satisfy 192#true [2019-10-07 03:55:14,790 INFO L193 IcfgInterpreter]: Reachable states at location L604-3 satisfy 98#true [2019-10-07 03:55:14,791 INFO L193 IcfgInterpreter]: Reachable states at location L604-4 satisfy 89#(or (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.offset|))) (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.base|)))) [2019-10-07 03:55:14,791 INFO L193 IcfgInterpreter]: Reachable states at location failErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 342#true [2019-10-07 03:55:15,091 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:55:15,091 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 12] total 16 [2019-10-07 03:55:15,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 03:55:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 03:55:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-07 03:55:15,093 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 16 states. [2019-10-07 03:55:15,879 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-07 03:55:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:55:17,017 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2019-10-07 03:55:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 03:55:17,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-10-07 03:55:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:55:17,020 INFO L225 Difference]: With dead ends: 129 [2019-10-07 03:55:17,020 INFO L226 Difference]: Without dead ends: 126 [2019-10-07 03:55:17,021 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-10-07 03:55:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-07 03:55:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2019-10-07 03:55:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-07 03:55:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-10-07 03:55:17,030 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 33 [2019-10-07 03:55:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:55:17,031 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-10-07 03:55:17,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 03:55:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-10-07 03:55:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 03:55:17,032 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:55:17,032 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:55:17,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:55:17,245 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:55:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:55:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2140628394, now seen corresponding path program 1 times [2019-10-07 03:55:17,246 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:55:17,246 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:17,246 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:17,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:55:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:17,307 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:17,308 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:55:17,308 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:55:17,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:55:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:55:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:55:17,309 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 5 states. [2019-10-07 03:55:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:55:17,356 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2019-10-07 03:55:17,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:55:17,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-07 03:55:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:55:17,358 INFO L225 Difference]: With dead ends: 134 [2019-10-07 03:55:17,358 INFO L226 Difference]: Without dead ends: 131 [2019-10-07 03:55:17,358 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:55:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-07 03:55:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-10-07 03:55:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-07 03:55:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2019-10-07 03:55:17,368 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 36 [2019-10-07 03:55:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:55:17,368 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2019-10-07 03:55:17,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:55:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2019-10-07 03:55:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 03:55:17,371 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:55:17,371 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:55:17,371 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:55:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:55:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 82771553, now seen corresponding path program 1 times [2019-10-07 03:55:17,372 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:55:17,372 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:17,372 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:17,372 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:55:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:17,566 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-07 03:55:17,566 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:17,567 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:55:17,567 INFO L95 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-07 03:55:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:17,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-07 03:55:17,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:55:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:17,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:55:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:55:17,969 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:55:17,970 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [7] total 13 [2019-10-07 03:55:17,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 03:55:17,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 03:55:17,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:55:17,972 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 12 states. [2019-10-07 03:55:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:55:18,529 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2019-10-07 03:55:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 03:55:18,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-10-07 03:55:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:55:18,531 INFO L225 Difference]: With dead ends: 132 [2019-10-07 03:55:18,532 INFO L226 Difference]: Without dead ends: 129 [2019-10-07 03:55:18,533 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:55:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-07 03:55:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-10-07 03:55:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-07 03:55:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-10-07 03:55:18,542 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 39 [2019-10-07 03:55:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:55:18,543 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-10-07 03:55:18,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 03:55:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-10-07 03:55:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 03:55:18,544 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:55:18,544 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:55:18,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:55:18,757 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:55:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:55:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash -14144212, now seen corresponding path program 1 times [2019-10-07 03:55:18,758 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:55:18,759 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:18,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:18,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:55:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:18,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:18,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:55:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 03:55:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:19,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-07 03:55:19,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:55:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:19,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:55:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:19,200 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:55:19,202 INFO L162 IcfgInterpreter]: Started Sifa with 36 locations of interest [2019-10-07 03:55:19,202 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:55:19,202 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:55:19,203 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:55:19,203 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:55:19,228 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:55:28,313 INFO L199 IcfgInterpreter]: Interpreting procedure inspect_before with input of size 8 for LOIs [2019-10-07 03:55:28,473 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:55:28,480 INFO L199 IcfgInterpreter]: Interpreting procedure fail with input of size 19 for LOIs [2019-10-07 03:55:28,483 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:55:28,483 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:55:28,483 INFO L193 IcfgInterpreter]: Reachable states at location L612-3 satisfy 568#true [2019-10-07 03:55:28,483 INFO L193 IcfgInterpreter]: Reachable states at location L608 satisfy 306#true [2019-10-07 03:55:28,484 INFO L193 IcfgInterpreter]: Reachable states at location L612-4 satisfy 558#true [2019-10-07 03:55:28,484 INFO L193 IcfgInterpreter]: Reachable states at location L628-1 satisfy 69#(and (<= 0 (+ |main_#t~nondet36| 2147483648)) (<= |main_#t~nondet36| 2147483647)) [2019-10-07 03:55:28,484 INFO L193 IcfgInterpreter]: Reachable states at location L628-3 satisfy 64#true [2019-10-07 03:55:28,484 INFO L193 IcfgInterpreter]: Reachable states at location inspect_beforeENTRY satisfy 84#(or (not (= 0 |inspect_before_#in~shape.offset|)) (not (= 0 |inspect_before_#in~shape.base|))) [2019-10-07 03:55:28,484 INFO L193 IcfgInterpreter]: Reachable states at location L608-3 satisfy 319#true [2019-10-07 03:55:28,484 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-07 03:55:28,485 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-07 03:55:28,485 INFO L193 IcfgInterpreter]: Reachable states at location L628-4 satisfy 74#true [2019-10-07 03:55:28,485 INFO L193 IcfgInterpreter]: Reachable states at location L607-3 satisfy 288#true [2019-10-07 03:55:28,485 INFO L193 IcfgInterpreter]: Reachable states at location L607-4 satisfy 274#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:28,485 INFO L193 IcfgInterpreter]: Reachable states at location L605-2 satisfy 371#true [2019-10-07 03:55:28,485 INFO L193 IcfgInterpreter]: Reachable states at location failENTRY satisfy 601#(exists ((v_inspect_before_~shape.base_BEFORE_CALL_3 Int) (v_inspect_before_~shape.offset_BEFORE_CALL_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_3) v_inspect_before_~shape.offset_BEFORE_CALL_3)) (= 0 (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_3) (+ v_inspect_before_~shape.offset_BEFORE_CALL_3 4))) (= (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_3) (+ v_inspect_before_~shape.offset_BEFORE_CALL_3 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_3) v_inspect_before_~shape.offset_BEFORE_CALL_3)))) [2019-10-07 03:55:28,486 INFO L193 IcfgInterpreter]: Reachable states at location L605-3 satisfy 376#true [2019-10-07 03:55:28,486 INFO L193 IcfgInterpreter]: Reachable states at location L612 satisfy 563#true [2019-10-07 03:55:28,486 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 345#true [2019-10-07 03:55:28,486 INFO L193 IcfgInterpreter]: Reachable states at location L611-2 satisfy 550#true [2019-10-07 03:55:28,486 INFO L193 IcfgInterpreter]: Reachable states at location L613-4 satisfy 573#true [2019-10-07 03:55:28,486 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 592#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:55:28,487 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 545#true [2019-10-07 03:55:28,487 INFO L193 IcfgInterpreter]: Reachable states at location L607 satisfy 279#(or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= 0 inspect_before_~shape.base)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|)) (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= inspect_before_~shape.offset 0)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|))) [2019-10-07 03:55:28,487 INFO L193 IcfgInterpreter]: Reachable states at location L609-3 satisfy 358#true [2019-10-07 03:55:28,487 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 381#true [2019-10-07 03:55:28,487 INFO L193 IcfgInterpreter]: Reachable states at location L609-4 satisfy 332#true [2019-10-07 03:55:28,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 597#(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-07 03:55:28,488 INFO L193 IcfgInterpreter]: Reachable states at location L608-4 satisfy 297#true [2019-10-07 03:55:28,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:55:28,488 INFO L193 IcfgInterpreter]: Reachable states at location L606-3 satisfy 269#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:28,488 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 578#true [2019-10-07 03:55:28,489 INFO L193 IcfgInterpreter]: Reachable states at location L643 satisfy 79#(or (not (= main_~data~0.base 0)) (not (= 0 main_~data~0.offset))) [2019-10-07 03:55:28,489 INFO L193 IcfgInterpreter]: Reachable states at location L606-4 satisfy 264#true [2019-10-07 03:55:28,489 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 583#true [2019-10-07 03:55:28,489 INFO L193 IcfgInterpreter]: Reachable states at location L604-3 satisfy 98#true [2019-10-07 03:55:28,489 INFO L193 IcfgInterpreter]: Reachable states at location L604-4 satisfy 89#(or (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.offset|))) (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.base|)))) [2019-10-07 03:55:28,489 INFO L193 IcfgInterpreter]: Reachable states at location failErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 606#(exists ((v_inspect_before_~shape.base_BEFORE_CALL_3 Int) (v_inspect_before_~shape.offset_BEFORE_CALL_3 Int)) (and (= 0 (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_3) v_inspect_before_~shape.offset_BEFORE_CALL_3)) (= 0 (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_3) (+ v_inspect_before_~shape.offset_BEFORE_CALL_3 4))) (= (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_3) (+ v_inspect_before_~shape.offset_BEFORE_CALL_3 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_3) v_inspect_before_~shape.offset_BEFORE_CALL_3)))) [2019-10-07 03:55:28,851 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:55:28,851 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 22 [2019-10-07 03:55:28,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 03:55:28,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 03:55:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-10-07 03:55:28,853 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 22 states. [2019-10-07 03:55:33,903 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-07 03:55:34,192 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-07 03:55:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:55:37,819 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2019-10-07 03:55:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 03:55:37,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-10-07 03:55:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:55:37,823 INFO L225 Difference]: With dead ends: 243 [2019-10-07 03:55:37,823 INFO L226 Difference]: Without dead ends: 156 [2019-10-07 03:55:37,824 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 03:55:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-07 03:55:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2019-10-07 03:55:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-07 03:55:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2019-10-07 03:55:37,837 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 39 [2019-10-07 03:55:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:55:37,837 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2019-10-07 03:55:37,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 03:55:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2019-10-07 03:55:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 03:55:37,838 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:55:37,838 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:55:38,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:55:38,046 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:55:38,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:55:38,046 INFO L82 PathProgramCache]: Analyzing trace with hash 419329379, now seen corresponding path program 1 times [2019-10-07 03:55:38,046 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:55:38,046 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:38,047 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:38,047 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:55:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:38,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:38,145 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:55:38,145 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 03:55:38,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 03:55:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 03:55:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:55:38,147 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand 7 states. [2019-10-07 03:55:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:55:38,431 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2019-10-07 03:55:38,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:55:38,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-10-07 03:55:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:55:38,433 INFO L225 Difference]: With dead ends: 157 [2019-10-07 03:55:38,433 INFO L226 Difference]: Without dead ends: 154 [2019-10-07 03:55:38,434 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:55:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-07 03:55:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-07 03:55:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-07 03:55:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2019-10-07 03:55:38,445 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 42 [2019-10-07 03:55:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:55:38,445 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2019-10-07 03:55:38,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 03:55:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2019-10-07 03:55:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 03:55:38,446 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:55:38,446 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:55:38,447 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:55:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:55:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1104040701, now seen corresponding path program 2 times [2019-10-07 03:55:38,447 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:55:38,447 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:38,447 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:38,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:55:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:55:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:55:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:38,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:55:38,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:55:38,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-07 03:55:38,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 03:55:38,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 03:55:38,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-07 03:55:38,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:55:39,320 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-07 03:55:39,453 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-07 03:55:39,646 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:55:39,700 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:55:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:40,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:55:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:55:40,559 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:55:40,563 INFO L162 IcfgInterpreter]: Started Sifa with 36 locations of interest [2019-10-07 03:55:40,563 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:55:40,564 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:55:40,564 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:55:40,564 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:55:40,596 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:55:52,428 INFO L199 IcfgInterpreter]: Interpreting procedure inspect_before with input of size 8 for LOIs [2019-10-07 03:55:52,556 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:55:52,559 INFO L199 IcfgInterpreter]: Interpreting procedure fail with input of size 19 for LOIs [2019-10-07 03:55:52,561 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:55:52,562 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:55:52,562 INFO L193 IcfgInterpreter]: Reachable states at location L612-3 satisfy 568#true [2019-10-07 03:55:52,562 INFO L193 IcfgInterpreter]: Reachable states at location L608 satisfy 306#true [2019-10-07 03:55:52,562 INFO L193 IcfgInterpreter]: Reachable states at location L612-4 satisfy 558#true [2019-10-07 03:55:52,563 INFO L193 IcfgInterpreter]: Reachable states at location L628-1 satisfy 69#(and (<= 0 (+ |main_#t~nondet36| 2147483648)) (<= |main_#t~nondet36| 2147483647)) [2019-10-07 03:55:52,563 INFO L193 IcfgInterpreter]: Reachable states at location L628-3 satisfy 64#true [2019-10-07 03:55:52,563 INFO L193 IcfgInterpreter]: Reachable states at location inspect_beforeENTRY satisfy 84#(or (not (= 0 |inspect_before_#in~shape.offset|)) (not (= 0 |inspect_before_#in~shape.base|))) [2019-10-07 03:55:52,563 INFO L193 IcfgInterpreter]: Reachable states at location L608-3 satisfy 319#true [2019-10-07 03:55:52,563 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-07 03:55:52,563 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:55:52,564 INFO L193 IcfgInterpreter]: Reachable states at location L628-4 satisfy 74#true [2019-10-07 03:55:52,564 INFO L193 IcfgInterpreter]: Reachable states at location L607-3 satisfy 288#true [2019-10-07 03:55:52,564 INFO L193 IcfgInterpreter]: Reachable states at location L607-4 satisfy 274#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:52,564 INFO L193 IcfgInterpreter]: Reachable states at location L605-2 satisfy 371#true [2019-10-07 03:55:52,564 INFO L193 IcfgInterpreter]: Reachable states at location failENTRY satisfy 601#(exists ((v_inspect_before_~shape.offset_BEFORE_CALL_4 Int) (v_inspect_before_~shape.base_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_4) (+ v_inspect_before_~shape.offset_BEFORE_CALL_4 4))) (= 0 (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_4) v_inspect_before_~shape.offset_BEFORE_CALL_4)) (= (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_4) v_inspect_before_~shape.offset_BEFORE_CALL_4) 0) (= (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_4) (+ v_inspect_before_~shape.offset_BEFORE_CALL_4 4)) 0))) [2019-10-07 03:55:52,565 INFO L193 IcfgInterpreter]: Reachable states at location L605-3 satisfy 376#true [2019-10-07 03:55:52,565 INFO L193 IcfgInterpreter]: Reachable states at location L612 satisfy 563#true [2019-10-07 03:55:52,565 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 345#true [2019-10-07 03:55:52,565 INFO L193 IcfgInterpreter]: Reachable states at location L611-2 satisfy 550#true [2019-10-07 03:55:52,565 INFO L193 IcfgInterpreter]: Reachable states at location L613-4 satisfy 573#true [2019-10-07 03:55:52,566 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 592#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:55:52,566 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 545#true [2019-10-07 03:55:52,566 INFO L193 IcfgInterpreter]: Reachable states at location L607 satisfy 279#(or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= 0 inspect_before_~shape.base)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|)) (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.base|) (not (= inspect_before_~shape.offset 0)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem21.offset|))) [2019-10-07 03:55:52,566 INFO L193 IcfgInterpreter]: Reachable states at location L609-3 satisfy 358#true [2019-10-07 03:55:52,566 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 381#true [2019-10-07 03:55:52,566 INFO L193 IcfgInterpreter]: Reachable states at location L609-4 satisfy 332#true [2019-10-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 597#(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-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location L608-4 satisfy 297#true [2019-10-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location L606-3 satisfy 269#(or (not (= 0 inspect_before_~shape.base)) (not (= inspect_before_~shape.offset 0))) [2019-10-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 578#true [2019-10-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location L643 satisfy 79#(or (not (= main_~data~0.base 0)) (not (= 0 main_~data~0.offset))) [2019-10-07 03:55:52,567 INFO L193 IcfgInterpreter]: Reachable states at location L606-4 satisfy 264#true [2019-10-07 03:55:52,568 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 583#true [2019-10-07 03:55:52,568 INFO L193 IcfgInterpreter]: Reachable states at location L604-3 satisfy 98#true [2019-10-07 03:55:52,568 INFO L193 IcfgInterpreter]: Reachable states at location L604-4 satisfy 89#(or (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.offset|))) (and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#in~shape.base| inspect_before_~shape.base) (not (= 0 |inspect_before_#in~shape.base|)))) [2019-10-07 03:55:52,568 INFO L193 IcfgInterpreter]: Reachable states at location failErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 606#(exists ((v_inspect_before_~shape.offset_BEFORE_CALL_4 Int) (v_inspect_before_~shape.base_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_4) (+ v_inspect_before_~shape.offset_BEFORE_CALL_4 4))) (= 0 (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_4) v_inspect_before_~shape.offset_BEFORE_CALL_4)) (= (select (select |#memory_$Pointer$.offset| v_inspect_before_~shape.base_BEFORE_CALL_4) v_inspect_before_~shape.offset_BEFORE_CALL_4) 0) (= (select (select |#memory_$Pointer$.base| v_inspect_before_~shape.base_BEFORE_CALL_4) (+ v_inspect_before_~shape.offset_BEFORE_CALL_4 4)) 0))) [2019-10-07 03:55:53,174 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:55:53,174 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 12] total 34 [2019-10-07 03:55:53,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-07 03:55:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-07 03:55:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 03:55:53,177 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand 34 states. [2019-10-07 03:55:57,808 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-07 03:55:57,982 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-07 03:55:58,547 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-07 03:55:58,829 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-10-07 03:55:59,471 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-10-07 03:55:59,758 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2019-10-07 03:56:00,038 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-10-07 03:56:00,417 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-10-07 03:56:01,243 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 102 [2019-10-07 03:56:02,219 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2019-10-07 03:56:02,685 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 112 [2019-10-07 03:56:03,077 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2019-10-07 03:56:03,764 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-10-07 03:56:07,307 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-07 03:56:07,639 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-10-07 03:56:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:56:07,945 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2019-10-07 03:56:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 03:56:07,945 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-10-07 03:56:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:56:07,947 INFO L225 Difference]: With dead ends: 196 [2019-10-07 03:56:07,947 INFO L226 Difference]: Without dead ends: 193 [2019-10-07 03:56:07,949 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=487, Invalid=2819, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 03:56:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-07 03:56:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 152. [2019-10-07 03:56:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-07 03:56:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2019-10-07 03:56:07,972 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 41 [2019-10-07 03:56:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:56:07,972 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2019-10-07 03:56:07,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-07 03:56:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2019-10-07 03:56:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 03:56:07,973 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:56:07,973 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:56:08,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:56:08,178 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:56:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:56:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1890977182, now seen corresponding path program 1 times [2019-10-07 03:56:08,179 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:56:08,179 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:56:08,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:56:08,180 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:56:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:56:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:56:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:56:08,465 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:56:08,465 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:56:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:56:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:56:08,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-07 03:56:08,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:56:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:56:09,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:56:09,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:56:09,768 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 03:56:09,775 INFO L168 Benchmark]: Toolchain (without parser) took 81738.60 ms. Allocated memory was 137.9 MB in the beginning and 490.7 MB in the end (delta: 352.8 MB). Free memory was 100.5 MB in the beginning and 422.3 MB in the end (delta: -321.9 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:56:09,776 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:56:09,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.88 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.3 MB in the beginning and 164.9 MB in the end (delta: -64.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:56:09,777 INFO L168 Benchmark]: Boogie Preprocessor took 90.71 ms. Allocated memory is still 200.8 MB. Free memory was 164.9 MB in the beginning and 161.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:56:09,777 INFO L168 Benchmark]: RCFGBuilder took 1157.47 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 161.0 MB in the beginning and 187.2 MB in the end (delta: -26.1 MB). Peak memory consumption was 80.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:56:09,777 INFO L168 Benchmark]: TraceAbstraction took 79841.75 ms. Allocated memory was 233.3 MB in the beginning and 490.7 MB in the end (delta: 257.4 MB). Free memory was 187.2 MB in the beginning and 422.3 MB in the end (delta: -235.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:56:09,779 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 643.88 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.3 MB in the beginning and 164.9 MB in the end (delta: -64.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.71 ms. Allocated memory is still 200.8 MB. Free memory was 164.9 MB in the beginning and 161.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1157.47 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 161.0 MB in the beginning and 187.2 MB in the end (delta: -26.1 MB). Peak memory consumption was 80.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79841.75 ms. Allocated memory was 233.3 MB in the beginning and 490.7 MB in the end (delta: 257.4 MB). Free memory was 187.2 MB in the beginning and 422.3 MB in the end (delta: -235.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...