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/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:48:48,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:48:48,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:48:48,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:48:48,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:48:48,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:48:48,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:48:48,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:48:48,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:48:48,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:48:48,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:48:48,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:48:48,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:48:48,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:48:48,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:48:48,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:48:48,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:48:48,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:48:48,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:48:48,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:48:48,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:48:48,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:48:48,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:48:48,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:48:48,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:48:48,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:48:48,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:48:48,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:48:48,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:48:48,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:48:48,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:48:48,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:48:48,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:48:48,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:48:48,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:48:48,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:48:48,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:48:48,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:48:48,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:48:48,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:48:48,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:48:48,914 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:48:48,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:48:48,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:48:48,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:48:48,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:48:48,937 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:48:48,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:48:48,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:48:48,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:48:48,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:48:48,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:48:48,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:48:48,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:48:48,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:48:48,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:48:48,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:48:48,940 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:48:48,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:48:48,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:48:48,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:48:48,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:48:48,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:48:48,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:48,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:48:48,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:48:48,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:48:48,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:48:48,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:48:48,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:48:48,943 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:48:49,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:48:49,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:48:49,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:48:49,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:48:49,287 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:48:49,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-10-07 03:48:49,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564969eda/7823577e63c74e02a293d35a8c26dfea/FLAG1f1a2477f [2019-10-07 03:48:49,949 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:48:49,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-10-07 03:48:49,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564969eda/7823577e63c74e02a293d35a8c26dfea/FLAG1f1a2477f [2019-10-07 03:48:50,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564969eda/7823577e63c74e02a293d35a8c26dfea [2019-10-07 03:48:50,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:48:50,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:48:50,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:50,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:48:50,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:48:50,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ad3bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50, skipping insertion in model container [2019-10-07 03:48:50,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,235 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:48:50,294 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:48:50,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:50,810 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:48:50,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:50,915 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:48:50,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50 WrapperNode [2019-10-07 03:48:50,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:50,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:48:50,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:48:50,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:48:50,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (1/1) ... [2019-10-07 03:48:50,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:48:50,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:48:50,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:48:50,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:48:50,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (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:48:51,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:48:51,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:48:51,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:48:51,039 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:48:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:48:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:48:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:48:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:48:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:48:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:48:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:48:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:48:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:48:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:48:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:48:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:48:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:48:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:48:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:48:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:48:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:48:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:48:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:48:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:48:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:48:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:48:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:48:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:48:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:48:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:48:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:48:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:48:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:48:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:48:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:48:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:48:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:48:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:48:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:48:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:48:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:48:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:48:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:48:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:48:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:48:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:48:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:48:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:48:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:48:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:48:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:48:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:48:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:48:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:48:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:48:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:48:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:51,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:51,671 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-07 03:48:51,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:51 BoogieIcfgContainer [2019-10-07 03:48:51,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:51,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:51,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:51,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:51,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:48:50" (1/3) ... [2019-10-07 03:48:51,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1f62e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:51, skipping insertion in model container [2019-10-07 03:48:51,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:50" (2/3) ... [2019-10-07 03:48:51,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1f62e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:51, skipping insertion in model container [2019-10-07 03:48:51,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:51" (3/3) ... [2019-10-07 03:48:51,681 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-07 03:48:51,692 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:51,700 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-07 03:48:51,712 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-07 03:48:51,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:51,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:51,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:51,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:51,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:51,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:51,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:51,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-07 03:48:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:48:51,761 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:51,762 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:51,764 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:51,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash 749315359, now seen corresponding path program 1 times [2019-10-07 03:48:51,777 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:51,777 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:51,778 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:51,778 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:51,931 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:48:51,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:51,932 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:51,938 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:48:51,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:48:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:48:51,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:51,959 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-07 03:48:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:51,983 INFO L93 Difference]: Finished difference Result 65 states and 99 transitions. [2019-10-07 03:48:51,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:48:51,985 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-07 03:48:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:51,997 INFO L225 Difference]: With dead ends: 65 [2019-10-07 03:48:51,998 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 03:48:52,004 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:48:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 03:48:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-07 03:48:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 03:48:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-07 03:48:52,046 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2019-10-07 03:48:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:52,047 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-07 03:48:52,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:48:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-07 03:48:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:48:52,048 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:52,048 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:52,048 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1712971286, now seen corresponding path program 1 times [2019-10-07 03:48:52,049 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:52,049 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,050 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,050 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:52,223 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:48:52,223 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,224 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:52,242 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:52,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:52,245 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-10-07 03:48:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:52,358 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-07 03:48:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:52,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:48:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:52,360 INFO L225 Difference]: With dead ends: 43 [2019-10-07 03:48:52,360 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 03:48:52,361 INFO L606 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-07 03:48:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 03:48:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-10-07 03:48:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 03:48:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-07 03:48:52,375 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-07 03:48:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:52,376 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-07 03:48:52,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-07 03:48:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:48:52,377 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:52,377 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:52,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash -994155934, now seen corresponding path program 1 times [2019-10-07 03:48:52,379 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:52,379 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:52,475 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:48:52,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,475 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:52,476 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:52,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:52,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:52,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:52,478 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2019-10-07 03:48:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:52,507 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2019-10-07 03:48:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:52,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 03:48:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:52,511 INFO L225 Difference]: With dead ends: 71 [2019-10-07 03:48:52,511 INFO L226 Difference]: Without dead ends: 50 [2019-10-07 03:48:52,512 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:48:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-07 03:48:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2019-10-07 03:48:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 03:48:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-07 03:48:52,521 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 13 [2019-10-07 03:48:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:52,521 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-07 03:48:52,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-07 03:48:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:48:52,522 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:52,522 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:52,523 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1588532202, now seen corresponding path program 1 times [2019-10-07 03:48:52,524 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:52,524 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,524 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,524 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:52,813 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:48:52,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,817 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:52,818 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 03:48:52,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 03:48:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 03:48:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:48:52,819 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 7 states. [2019-10-07 03:48:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:53,173 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-10-07 03:48:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:48:53,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-07 03:48:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:53,175 INFO L225 Difference]: With dead ends: 48 [2019-10-07 03:48:53,175 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 03:48:53,176 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-07 03:48:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 03:48:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-07 03:48:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-07 03:48:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-10-07 03:48:53,182 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2019-10-07 03:48:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:53,182 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-07 03:48:53,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 03:48:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-10-07 03:48:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 03:48:53,183 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:53,183 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:53,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:53,184 INFO L82 PathProgramCache]: Analyzing trace with hash -428681333, now seen corresponding path program 1 times [2019-10-07 03:48:53,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:53,185 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:53,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:53,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:53,291 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:48:53,292 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:53,292 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:53,292 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:48:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:53,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-07 03:48:53,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:53,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-10-07 03:48:53,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-07 03:48:53,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-07 03:48:53,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-07 03:48:53,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-07 03:48:53,640 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-07 03:48:53,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-07 03:48:53,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-10-07 03:48:53,658 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_22|]} [2019-10-07 03:48:53,664 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:53,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-07 03:48:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:53,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,711 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-10-07 03:48:53,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,712 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-07 03:48:53,714 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:48:53,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:53,725 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:53,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:53,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-07 03:48:53,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:53,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-10-07 03:48:53,782 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 366 treesize of output 358 [2019-10-07 03:48:53,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-07 03:48:53,970 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2019-10-07 03:48:53,970 INFO L567 ElimStorePlain]: treesize reduction 305, result has 14.3 percent of original size [2019-10-07 03:48:53,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:53,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:53,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:53,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-07 03:48:53,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-10-07 03:48:54,085 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:48:54,086 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:48:54,125 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 03:48:54,125 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:48:54,137 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:48:54,147 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:48:54,147 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:48:54,275 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:48:55,036 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:48:55,043 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:48:55,043 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:48:55,044 INFO L193 IcfgInterpreter]: Reachable states at location L993-1 satisfy 132#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:48:55,044 INFO L193 IcfgInterpreter]: Reachable states at location L1017-4 satisfy 154#true [2019-10-07 03:48:55,044 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 194#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:48:55,044 INFO L193 IcfgInterpreter]: Reachable states at location L993-3 satisfy 137#true [2019-10-07 03:48:55,044 INFO L193 IcfgInterpreter]: Reachable states at location L1000 satisfy 173#(or (exists ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= 0 |main_#t~malloc2.offset|) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) v_DerPreprocessor_8) main_~head~0.offset |main_#t~malloc2.offset|)) main_~x~0.base (store (select (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) v_DerPreprocessor_8) main_~head~0.offset |main_#t~malloc2.offset|)) main_~x~0.base) main_~x~0.offset main_~head~0.offset))) (<= 0 |#NULL.base|) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= |#memory_int| (store (store |old(#memory_int)| main_~head~0.base (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) 0) main_~head~0.offset v_DerPreprocessor_7)) main_~x~0.base (store (select (store |old(#memory_int)| main_~head~0.base (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) 0) main_~head~0.offset v_DerPreprocessor_7)) main_~x~0.base) main_~x~0.offset (select (select |#memory_int| main_~x~0.base) main_~x~0.offset)))) (<= |main_#t~nondet4| 2147483647) (= main_~x~0.offset |main_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) v_DerPreprocessor_9) main_~head~0.offset |main_#t~malloc2.base|)) main_~x~0.base (store (select (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) v_DerPreprocessor_9) main_~head~0.offset |main_#t~malloc2.base|)) main_~x~0.base) main_~x~0.offset main_~head~0.base))) (<= 0 (+ |main_#t~nondet4| 2147483648)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 8) |main_#t~malloc2.base| 8)) (= 1 main_~state~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc2.base| main_~x~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= 0 (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc2.base|)) (= |#NULL.offset| 0))) (exists ((v_main_~x~0.offset_34 Int) (v_main_~x~0.base_36 Int)) (and (not (= |main_#t~malloc2.base| 0)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= 0 |main_#t~malloc2.offset|) (or (and (= v_main_~x~0.base_36 main_~x~0.base) (= main_~x~0.offset v_main_~x~0.offset_34)) (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_36) v_main_~x~0.offset_34))) (or (not (= main_~x~0.offset v_main_~x~0.offset_34)) (not (= v_main_~x~0.base_36 main_~x~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_36) v_main_~x~0.offset_34) main_~head~0.base)) (<= |main_#t~nondet4| 2147483647) (= |main_#t~malloc2.base| main_~x~0.base) (= main_~x~0.offset |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)) (or (and (= v_main_~x~0.base_36 main_~x~0.base) (= main_~x~0.offset v_main_~x~0.offset_34)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_36) v_main_~x~0.offset_34) |main_#t~malloc2.offset|)) (or (not (= main_~x~0.offset v_main_~x~0.offset_34)) (not (= v_main_~x~0.base_36 main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_36) v_main_~x~0.offset_34) main_~head~0.offset)) (<= 0 (+ |main_#t~nondet4| 2147483648)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1)))) [2019-10-07 03:48:55,045 INFO L193 IcfgInterpreter]: Reachable states at location L1000-1 satisfy 181#true [2019-10-07 03:48:55,045 INFO L193 IcfgInterpreter]: Reachable states at location L1012-3 satisfy 113#true [2019-10-07 03:48:55,045 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:48:55,045 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:48:55,046 INFO L193 IcfgInterpreter]: Reachable states at location L1012-4 satisfy 190#(or (exists ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_10 Int)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= 0 |main_#t~malloc2.offset|) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) v_DerPreprocessor_8) main_~head~0.offset |main_#t~malloc2.offset|)) main_~x~0.base (store (store (select (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) v_DerPreprocessor_8) main_~head~0.offset |main_#t~malloc2.offset|)) main_~x~0.base) main_~x~0.offset main_~head~0.offset) (+ main_~x~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))))) (<= 0 |#NULL.base|) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 8) |main_#t~malloc2.base| 8)) (= 1 main_~state~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) v_DerPreprocessor_9) main_~head~0.offset |main_#t~malloc2.base|)) main_~x~0.base (store (store (select (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) v_DerPreprocessor_9) main_~head~0.offset |main_#t~malloc2.base|)) main_~x~0.base) main_~x~0.offset main_~head~0.base) (+ main_~x~0.offset 4) (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))))) (= |main_#t~malloc2.base| main_~x~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= 0 (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc2.base|)) (= |#NULL.offset| 0) (= (store (store |old(#memory_int)| main_~head~0.base (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) 0) main_~head~0.offset v_DerPreprocessor_7)) main_~x~0.base (store (store (select (store |old(#memory_int)| main_~head~0.base (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) 0) main_~head~0.offset v_DerPreprocessor_7)) main_~x~0.base) main_~x~0.offset v_DerPreprocessor_10) (+ main_~x~0.offset 4) main_~state~0)) |#memory_int|))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0)) [2019-10-07 03:48:55,047 INFO L193 IcfgInterpreter]: Reachable states at location mainErr1ASSERT_VIOLATIONERROR_FUNCTION satisfy 168#(or (and (<= 0 main_~x~0.base) (exists ((v_main_~x~0.offset_33 Int) (v_main_~x~0.base_35 Int)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_int| v_main_~x~0.base_35) (+ v_main_~x~0.offset_33 4)) main_~state~0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))) (= 0 main_~x~0.base) (<= main_~x~0.offset 0) (<= main_~x~0.base 0) (= main_~x~0.offset 0) (<= 0 main_~x~0.offset)) (and (<= 0 main_~x~0.base) (= 0 main_~x~0.base) (<= main_~x~0.offset 0) (<= main_~x~0.base 0) (= main_~x~0.offset 0) (exists ((v_DerPreprocessor_4 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) main_~state~0)) |#memory_int|) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 1 main_~state~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))) (<= 0 main_~x~0.offset))) [2019-10-07 03:48:55,047 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 199#(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:48:55,047 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:48:55,047 INFO L193 IcfgInterpreter]: Reachable states at location L1012-5 satisfy 118#true [2019-10-07 03:48:55,048 INFO L193 IcfgInterpreter]: Reachable states at location L1017-1 satisfy 159#(and (or (and (exists ((v_main_~x~0.offset_33 Int) (v_main_~x~0.base_35 Int)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_int| v_main_~x~0.base_35) (+ v_main_~x~0.offset_33 4)) main_~state~0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))) (= 0 main_~x~0.base) (= main_~x~0.offset 0)) (and (= 0 main_~x~0.base) (= main_~x~0.offset 0) (exists ((v_DerPreprocessor_4 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) main_~state~0)) |#memory_int|) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 1 main_~state~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))))) (<= 0 main_~x~0.base) (<= main_~x~0.offset 0) (<= main_~x~0.base 0) (<= 0 main_~x~0.offset)) [2019-10-07 03:48:55,552 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:48:55,552 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 9] total 16 [2019-10-07 03:48:55,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 03:48:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 03:48:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-07 03:48:55,554 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 16 states. [2019-10-07 03:48:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:56,474 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-10-07 03:48:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 03:48:56,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-10-07 03:48:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:56,478 INFO L225 Difference]: With dead ends: 61 [2019-10-07 03:48:56,478 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 03:48:56,479 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-10-07 03:48:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 03:48:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2019-10-07 03:48:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-07 03:48:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-10-07 03:48:56,487 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 16 [2019-10-07 03:48:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:56,487 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-10-07 03:48:56,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 03:48:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-10-07 03:48:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 03:48:56,488 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:56,488 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:56,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:48:56,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash -963397692, now seen corresponding path program 1 times [2019-10-07 03:48:56,694 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:56,695 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:56,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:56,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:56,745 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:56,746 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:56,746 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:56,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:56,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:56,747 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 3 states. [2019-10-07 03:48:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:56,779 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2019-10-07 03:48:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:56,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-07 03:48:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:56,781 INFO L225 Difference]: With dead ends: 93 [2019-10-07 03:48:56,781 INFO L226 Difference]: Without dead ends: 72 [2019-10-07 03:48:56,782 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:48:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-07 03:48:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2019-10-07 03:48:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 03:48:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-07 03:48:56,798 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 20 [2019-10-07 03:48:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:56,800 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-07 03:48:56,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-07 03:48:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:48:56,802 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:56,802 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] [2019-10-07 03:48:56,802 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash 61914005, now seen corresponding path program 1 times [2019-10-07 03:48:56,806 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:56,806 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:56,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:56,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:57,158 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:48:57,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:57,159 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:57,159 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:48:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:57,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-07 03:48:57,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:57,877 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:48:57,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:58,322 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79