java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/list-properties/simple_built_from_end.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:55:58,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:55:58,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:55:58,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:55:58,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:55:58,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:55:58,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:55:58,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:55:58,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:55:58,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:55:58,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:55:58,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:55:58,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:55:58,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:55:58,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:55:58,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:55:58,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:55:58,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:55:58,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:55:58,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:55:58,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:55:58,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:55:58,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:55:58,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:55:58,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:55:58,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:55:58,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:55:58,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:55:58,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:55:58,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:55:58,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:55:58,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:55:58,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:55:58,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:55:58,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:55:58,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:55:58,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:55:58,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:55:58,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:55:58,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:55:58,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:55:58,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:55:58,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:55:58,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:55:58,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:55:58,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:55:58,772 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:55:58,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:55:58,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:55:58,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:55:58,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:55:58,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:55:58,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:55:58,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:55:58,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:55:58,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:55:58,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:55:58,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:55:58,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:55:58,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:55:58,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:55:58,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:55:58,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:55:58,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:55:58,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:55:58,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:55:58,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:55:58,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:55:58,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:55:58,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:55:58,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:55:59,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:55:59,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:55:59,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:55:59,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:55:59,062 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:55:59,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end.i [2019-10-13 22:55:59,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49c2fd5e/416989206a104bc8bb728e50e91af1ba/FLAGe67f6c609 [2019-10-13 22:55:59,662 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:55:59,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.i [2019-10-13 22:55:59,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49c2fd5e/416989206a104bc8bb728e50e91af1ba/FLAGe67f6c609 [2019-10-13 22:55:59,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49c2fd5e/416989206a104bc8bb728e50e91af1ba [2019-10-13 22:55:59,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:55:59,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:55:59,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:55:59,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:55:59,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:55:59,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:59" (1/1) ... [2019-10-13 22:55:59,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f920346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:59, skipping insertion in model container [2019-10-13 22:55:59,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:59" (1/1) ... [2019-10-13 22:55:59,987 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:56:00,031 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:56:00,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:56:00,549 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:56:00,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:56:00,666 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:56:00,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00 WrapperNode [2019-10-13 22:56:00,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:56:00,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:56:00,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:56:00,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:56:00,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... [2019-10-13 22:56:00,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:56:00,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:56:00,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:56:00,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:56:00,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:56:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:56:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:56:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 22:56:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 22:56:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-13 22:56:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-13 22:56:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-13 22:56:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 22:56:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:56:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:56:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:56:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 22:56:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 22:56:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 22:56:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 22:56:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 22:56:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 22:56:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 22:56:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 22:56:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 22:56:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 22:56:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 22:56:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 22:56:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 22:56:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 22:56:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 22:56:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 22:56:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 22:56:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 22:56:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-13 22:56:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-13 22:56:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-13 22:56:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 22:56:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 22:56:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 22:56:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 22:56:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 22:56:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 22:56:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 22:56:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 22:56:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 22:56:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 22:56:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 22:56:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 22:56:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 22:56:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 22:56:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 22:56:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 22:56:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 22:56:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 22:56:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 22:56:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 22:56:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 22:56:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 22:56:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 22:56:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 22:56:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 22:56:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 22:56:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 22:56:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 22:56:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 22:56:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 22:56:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 22:56:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 22:56:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 22:56:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 22:56:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 22:56:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 22:56:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 22:56:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 22:56:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 22:56:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 22:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 22:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 22:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 22:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 22:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 22:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 22:56:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 22:56:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 22:56:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 22:56:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 22:56:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 22:56:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:56:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 22:56:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:56:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 22:56:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:56:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 22:56:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:56:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:56:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:56:01,157 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 22:56:01,379 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:56:01,379 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:56:01,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:56:01 BoogieIcfgContainer [2019-10-13 22:56:01,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:56:01,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:56:01,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:56:01,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:56:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:59" (1/3) ... [2019-10-13 22:56:01,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7052c0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:56:01, skipping insertion in model container [2019-10-13 22:56:01,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:56:00" (2/3) ... [2019-10-13 22:56:01,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7052c0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:56:01, skipping insertion in model container [2019-10-13 22:56:01,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:56:01" (3/3) ... [2019-10-13 22:56:01,393 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2019-10-13 22:56:01,403 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:56:01,410 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:56:01,422 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:56:01,447 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:56:01,448 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:56:01,448 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:56:01,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:56:01,449 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:56:01,449 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:56:01,449 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:56:01,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:56:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 22:56:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-13 22:56:01,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:01,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:01,474 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash -493734478, now seen corresponding path program 1 times [2019-10-13 22:56:01,488 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:01,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280111606] [2019-10-13 22:56:01,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:01,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280111606] [2019-10-13 22:56:01,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:56:01,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 22:56:01,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264905355] [2019-10-13 22:56:01,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 22:56:01,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 22:56:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:56:01,633 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-13 22:56:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:01,655 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-10-13 22:56:01,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 22:56:01,656 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-13 22:56:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:01,664 INFO L225 Difference]: With dead ends: 28 [2019-10-13 22:56:01,665 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 22:56:01,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:56:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 22:56:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-13 22:56:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 22:56:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-13 22:56:01,701 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-10-13 22:56:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:01,702 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-13 22:56:01,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 22:56:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-13 22:56:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:56:01,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:01,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:01,703 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1859619042, now seen corresponding path program 1 times [2019-10-13 22:56:01,704 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:01,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303779236] [2019-10-13 22:56:01,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:01,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303779236] [2019-10-13 22:56:01,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:56:01,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:56:01,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132754066] [2019-10-13 22:56:01,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:56:01,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:01,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:56:01,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:56:01,796 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-10-13 22:56:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:01,815 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-13 22:56:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:56:01,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 22:56:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:01,816 INFO L225 Difference]: With dead ends: 24 [2019-10-13 22:56:01,817 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 22:56:01,818 INFO L600 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-13 22:56:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 22:56:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-10-13 22:56:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 22:56:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 22:56:01,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2019-10-13 22:56:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:01,823 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 22:56:01,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:56:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 22:56:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:56:01,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:01,825 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:01,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1159508965, now seen corresponding path program 1 times [2019-10-13 22:56:01,826 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:01,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906304360] [2019-10-13 22:56:01,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:01,978 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-13 22:56:01,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906304360] [2019-10-13 22:56:01,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:56:01,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:56:01,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426914361] [2019-10-13 22:56:01,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:56:01,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:56:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:56:01,983 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2019-10-13 22:56:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:02,037 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-10-13 22:56:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:56:02,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 22:56:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:02,039 INFO L225 Difference]: With dead ends: 23 [2019-10-13 22:56:02,040 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 22:56:02,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:56:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 22:56:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-13 22:56:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 22:56:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 22:56:02,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-10-13 22:56:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:02,072 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 22:56:02,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:56:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 22:56:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:56:02,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:02,074 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:02,074 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1495193777, now seen corresponding path program 1 times [2019-10-13 22:56:02,075 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:02,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255434823] [2019-10-13 22:56:02,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:02,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:02,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:02,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255434823] [2019-10-13 22:56:02,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551452025] [2019-10-13 22:56:02,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:02,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 22:56:02,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:02,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 22:56:02,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:56:02,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:56:02,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 22:56:02,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 22:56:02,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:56:02,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:56:02,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-10-13 22:56:02,583 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 15 treesize of output 7 [2019-10-13 22:56:02,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:56:02,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:56:02,600 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 15 treesize of output 7 [2019-10-13 22:56:02,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 22:56:02,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:56:02,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:56:02,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 22:56:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:02,613 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:02,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159081225] [2019-10-13 22:56:02,694 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 22:56:02,694 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:02,704 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:02,718 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:02,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:02,847 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:03,733 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:03,739 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:03,740 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:03,740 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 214#true [2019-10-13 22:56:03,740 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 346#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:03,741 INFO L193 IcfgInterpreter]: Reachable states at location L525 satisfy 337#(and (<= |main_#t~malloc3.offset| 0) (<= main_~t~0.offset 0) (<= 0 |main_#t~malloc3.offset|) (<= 0 main_~t~0.offset) (or (and (< |#StackHeapBarrier| |main_#t~malloc3.base|) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |main_#t~malloc3.offset| main_~t~0.offset) (= |main_#t~malloc3.base| main_~t~0.base) (= 8 (select |#length| |main_#t~malloc3.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= |main_#t~malloc3.offset| 0) (not (= |main_#t~malloc3.base| 0))) (and (= 0 (select |old(#valid)| |main_#t~malloc3.base|)) (= 0 |#NULL.base|) (= 0 main_~p~0.base) (<= |#NULL.base| 0) (= |main_#t~malloc3.offset| main_~t~0.offset) (= main_~p~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc3.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |#StackHeapBarrier| |main_#t~malloc3.base|) (= (store |old(#length)| |main_#t~malloc3.base| 8) |#length|) (= |main_#t~malloc3.base| main_~t~0.base) (= |#valid| (store |old(#valid)| |main_#t~malloc3.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (not (= |main_#t~malloc3.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-10-13 22:56:03,741 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:03,741 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:03,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 351#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:03,742 INFO L193 IcfgInterpreter]: Reachable states at location L530-1 satisfy 342#true [2019-10-13 22:56:03,742 INFO L193 IcfgInterpreter]: Reachable states at location L531-2 satisfy 296#true [2019-10-13 22:56:03,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:03,743 INFO L193 IcfgInterpreter]: Reachable states at location L523-3 satisfy 86#(or (and (= main_~t~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~t~0.base) main_~t~0.offset)) (= main_~t~0.offset main_~p~0.offset)) (and (= 0 |#NULL.base|) (= 0 main_~p~0.base) (<= |#NULL.base| 0) (<= 0 main_~p~0.base) (= main_~p~0.offset 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~p~0.base 0) (<= 0 main_~p~0.offset) (= |#valid| |old(#valid)|) (<= main_~p~0.offset 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2019-10-13 22:56:03,743 INFO L193 IcfgInterpreter]: Reachable states at location L531 satisfy 332#true [2019-10-13 22:56:03,743 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 255#true [2019-10-13 22:56:03,743 INFO L193 IcfgInterpreter]: Reachable states at location L523-1 satisfy 91#(and (or (and (<= 0 (+ |main_#t~nondet2| 2147483648)) (= 0 |#NULL.base|) (= 0 main_~p~0.base) (<= |#NULL.base| 0) (<= 0 main_~p~0.base) (= main_~p~0.offset 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~p~0.base 0) (<= 0 main_~p~0.offset) (= |#valid| |old(#valid)|) (<= main_~p~0.offset 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= 0 (+ |main_#t~nondet2| 2147483648)) (= main_~t~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~t~0.base) main_~t~0.offset)) (= main_~t~0.offset main_~p~0.offset))) (<= |main_#t~nondet2| 2147483647)) [2019-10-13 22:56:03,743 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 81#true [2019-10-13 22:56:04,296 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-13 22:56:04,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:04,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 8] total 13 [2019-10-13 22:56:04,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877604906] [2019-10-13 22:56:04,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 22:56:04,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 22:56:04,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-13 22:56:04,307 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 13 states. [2019-10-13 22:56:04,662 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-10-13 22:56:04,848 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-13 22:56:05,043 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-10-13 22:56:05,232 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-13 22:56:05,448 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-13 22:56:05,655 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-10-13 22:56:05,871 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-13 22:56:06,076 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-13 22:56:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:06,098 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-13 22:56:06,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 22:56:06,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-10-13 22:56:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:06,100 INFO L225 Difference]: With dead ends: 34 [2019-10-13 22:56:06,100 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 22:56:06,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-10-13 22:56:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 22:56:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-10-13 22:56:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 22:56:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-10-13 22:56:06,107 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2019-10-13 22:56:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:06,107 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-10-13 22:56:06,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 22:56:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-10-13 22:56:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 22:56:06,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:06,108 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:06,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:06,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 553956184, now seen corresponding path program 2 times [2019-10-13 22:56:06,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:06,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203344510] [2019-10-13 22:56:06,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:06,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:06,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:06,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203344510] [2019-10-13 22:56:06,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376428579] [2019-10-13 22:56:06,706 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:06,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 22:56:06,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:56:06,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-13 22:56:06,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:07,063 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:07,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1768488294] [2019-10-13 22:56:07,267 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 22:56:07,267 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:07,268 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:07,268 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:07,268 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:07,299 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:07,912 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:07,916 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:07,919 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:07,920 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 214#true [2019-10-13 22:56:07,920 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 346#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:07,920 INFO L193 IcfgInterpreter]: Reachable states at location L525 satisfy 337#(and (<= |main_#t~malloc3.offset| 0) (<= main_~t~0.offset 0) (or (and (< |#StackHeapBarrier| |main_#t~malloc3.base|) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |main_#t~malloc3.offset| main_~t~0.offset) (= |main_#t~malloc3.base| main_~t~0.base) (= 8 (select |#length| |main_#t~malloc3.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= |main_#t~malloc3.offset| 0) (not (= |main_#t~malloc3.base| 0))) (and (= 0 (select |old(#valid)| |main_#t~malloc3.base|)) (= 0 |#NULL.base|) (= |main_#t~malloc3.offset| main_~t~0.offset) (= 0 main_~p~0.base) (<= |#NULL.base| 0) (= main_~p~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc3.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< |#StackHeapBarrier| |main_#t~malloc3.base|) (= (store |old(#length)| |main_#t~malloc3.base| 8) |#length|) (= |main_#t~malloc3.base| main_~t~0.base) (= |#valid| (store |old(#valid)| |main_#t~malloc3.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (not (= |main_#t~malloc3.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc3.offset|) (<= 0 main_~t~0.offset)) [2019-10-13 22:56:07,920 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:07,920 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-13 22:56:07,921 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 351#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:07,921 INFO L193 IcfgInterpreter]: Reachable states at location L530-1 satisfy 342#true [2019-10-13 22:56:07,921 INFO L193 IcfgInterpreter]: Reachable states at location L531-2 satisfy 296#true [2019-10-13 22:56:07,921 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:07,921 INFO L193 IcfgInterpreter]: Reachable states at location L523-3 satisfy 86#(or (and (= 0 |#NULL.base|) (= 0 main_~p~0.base) (<= |#NULL.base| 0) (<= 0 main_~p~0.base) (= main_~p~0.offset 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= main_~p~0.base 0) (<= 0 main_~p~0.offset) (= |#valid| |old(#valid)|) (<= main_~p~0.offset 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= main_~t~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~t~0.base) main_~t~0.offset)) (= main_~t~0.offset main_~p~0.offset))) [2019-10-13 22:56:07,922 INFO L193 IcfgInterpreter]: Reachable states at location L531 satisfy 332#true [2019-10-13 22:56:07,922 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 255#true [2019-10-13 22:56:07,922 INFO L193 IcfgInterpreter]: Reachable states at location L523-1 satisfy 91#(and (or (and (<= 0 (+ |main_#t~nondet2| 2147483648)) (= main_~t~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~t~0.base) main_~t~0.offset)) (= main_~t~0.offset main_~p~0.offset)) (and (<= 0 (+ |main_#t~nondet2| 2147483648)) (= 0 |#NULL.base|) (= 0 main_~p~0.base) (<= |#NULL.base| 0) (<= 0 main_~p~0.base) (= main_~p~0.offset 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= main_~p~0.base 0) (<= 0 main_~p~0.offset) (= |#valid| |old(#valid)|) (<= main_~p~0.offset 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |main_#t~nondet2| 2147483647)) [2019-10-13 22:56:07,922 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 81#true [2019-10-13 22:56:08,527 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-13 22:56:08,528 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:08,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8] total 22 [2019-10-13 22:56:08,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169236122] [2019-10-13 22:56:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 22:56:08,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 22:56:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-10-13 22:56:08,530 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 22 states. [2019-10-13 22:56:08,763 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-10-13 22:56:08,951 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-13 22:56:09,135 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-13 22:56:09,323 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 37 [2019-10-13 22:56:09,514 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 43 [2019-10-13 22:56:09,661 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-10-13 22:56:09,843 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-10-13 22:56:10,025 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2019-10-13 22:56:10,191 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-10-13 22:56:10,365 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 52 [2019-10-13 22:56:10,544 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-10-13 22:56:10,693 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-10-13 22:56:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:10,761 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-10-13 22:56:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 22:56:10,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-10-13 22:56:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:10,763 INFO L225 Difference]: With dead ends: 30 [2019-10-13 22:56:10,763 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 22:56:10,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 22:56:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 22:56:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-13 22:56:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 22:56:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-13 22:56:10,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2019-10-13 22:56:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:10,770 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-13 22:56:10,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 22:56:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-13 22:56:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 22:56:10,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:10,772 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:10,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:10,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1649134676, now seen corresponding path program 3 times [2019-10-13 22:56:10,977 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:10,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451011834] [2019-10-13 22:56:10,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:10,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:10,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:11,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451011834] [2019-10-13 22:56:11,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65142526] [2019-10-13 22:56:11,200 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:11,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:56:11,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:56:11,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-13 22:56:11,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:12,070 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:13,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:13,266 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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:335) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 22:56:13,272 INFO L168 Benchmark]: Toolchain (without parser) took 13304.71 ms. Allocated memory was 142.1 MB in the beginning and 359.7 MB in the end (delta: 217.6 MB). Free memory was 99.5 MB in the beginning and 130.3 MB in the end (delta: -30.8 MB). Peak memory consumption was 186.8 MB. Max. memory is 7.1 GB. [2019-10-13 22:56:13,272 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 142.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 22:56:13,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.09 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 99.3 MB in the beginning and 168.7 MB in the end (delta: -69.3 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:56:13,273 INFO L168 Benchmark]: Boogie Preprocessor took 65.52 ms. Allocated memory is still 202.4 MB. Free memory was 168.7 MB in the beginning and 165.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:56:13,273 INFO L168 Benchmark]: RCFGBuilder took 647.17 ms. Allocated memory is still 202.4 MB. Free memory was 165.9 MB in the beginning and 123.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2019-10-13 22:56:13,274 INFO L168 Benchmark]: TraceAbstraction took 11887.38 ms. Allocated memory was 202.4 MB in the beginning and 359.7 MB in the end (delta: 157.3 MB). Free memory was 123.5 MB in the beginning and 130.3 MB in the end (delta: -6.8 MB). Peak memory consumption was 150.4 MB. Max. memory is 7.1 GB. [2019-10-13 22:56:13,276 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.28 ms. Allocated memory is still 142.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 698.09 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 99.3 MB in the beginning and 168.7 MB in the end (delta: -69.3 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.52 ms. Allocated memory is still 202.4 MB. Free memory was 168.7 MB in the beginning and 165.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 647.17 ms. Allocated memory is still 202.4 MB. Free memory was 165.9 MB in the beginning and 123.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11887.38 ms. Allocated memory was 202.4 MB in the beginning and 359.7 MB in the end (delta: 157.3 MB). Free memory was 123.5 MB in the beginning and 130.3 MB in the end (delta: -6.8 MB). Peak memory consumption was 150.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...