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-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:49:52,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:49:52,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:49:52,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:49:52,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:49:52,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:49:52,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:49:52,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:49:52,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:49:52,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:49:52,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:49:52,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:49:52,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:49:52,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:49:52,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:49:52,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:49:52,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:49:52,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:49:52,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:49:52,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:49:52,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:49:52,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:49:52,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:49:52,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:49:52,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:49:52,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:49:52,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:49:52,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:49:52,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:49:52,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:49:52,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:49:52,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:49:52,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:49:52,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:49:52,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:49:52,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:49:52,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:49:52,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:49:52,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:49:52,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:49:52,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:49:52,956 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:49:52,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:49:52,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:49:52,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:49:52,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:49:52,997 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:49:52,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:49:52,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:49:52,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:49:52,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:49:52,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:49:52,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:49:52,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:49:52,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:49:52,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:49:52,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:49:52,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:49:53,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:49:53,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:49:53,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:49:53,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:49:53,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:49:53,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:49:53,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:49:53,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:49:53,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:49:53,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:49:53,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:49:53,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:49:53,005 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:49:53,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:49:53,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:49:53,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:49:53,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:49:53,306 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:49:53,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i [2019-10-07 03:49:53,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33697fcec/28095fa32aa940488f0cb8eb9662941a/FLAG21bed4d52 [2019-10-07 03:49:53,968 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:49:53,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i [2019-10-07 03:49:53,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33697fcec/28095fa32aa940488f0cb8eb9662941a/FLAG21bed4d52 [2019-10-07 03:49:54,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33697fcec/28095fa32aa940488f0cb8eb9662941a [2019-10-07 03:49:54,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:49:54,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:49:54,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:49:54,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:49:54,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:49:54,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:49:54" (1/1) ... [2019-10-07 03:49:54,312 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 07.10 03:49:54, skipping insertion in model container [2019-10-07 03:49:54,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:49:54" (1/1) ... [2019-10-07 03:49:54,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:49:54,365 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:49:54,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:49:54,950 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:49:55,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:49:55,080 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:49:55,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55 WrapperNode [2019-10-07 03:49:55,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:49:55,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:49:55,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:49:55,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:49:55,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (1/1) ... [2019-10-07 03:49:55,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:49:55,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:49:55,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:49:55,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:49:55,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (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:49:55,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:49:55,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:49:55,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:49:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:49:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:49:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:49:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:49:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:49:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:49:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:49:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:49:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:49:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:49:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:49:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:49:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:49:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:49:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:49:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:49:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:49:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:49:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:49:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:49:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:49:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:49:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:49:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:49:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:49:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:49:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:49:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:49:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:49:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:49:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:49:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:49:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:49:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:49:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:49:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:49:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:49:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:49:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:49:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:49:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:49:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:49:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:49:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:49:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:49:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:49:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:49:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:49:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:49:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:49:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:49:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:49:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:49:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:49:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:49:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:49:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:49:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:49:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:49:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:49:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:49:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:49:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:49:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:49:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:49:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:49:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:49:56,028 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:49:56,028 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-07 03:49:56,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:49:56 BoogieIcfgContainer [2019-10-07 03:49:56,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:49:56,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:49:56,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:49:56,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:49:56,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:49:54" (1/3) ... [2019-10-07 03:49:56,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21130d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:49:56, skipping insertion in model container [2019-10-07 03:49:56,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:49:55" (2/3) ... [2019-10-07 03:49:56,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21130d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:49:56, skipping insertion in model container [2019-10-07 03:49:56,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:49:56" (3/3) ... [2019-10-07 03:49:56,039 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2019-10-07 03:49:56,050 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:49:56,059 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-07 03:49:56,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-07 03:49:56,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:49:56,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:49:56,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:49:56,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:49:56,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:49:56,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:49:56,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:49:56,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:49:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-07 03:49:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:49:56,127 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:56,128 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:56,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:56,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1881121825, now seen corresponding path program 1 times [2019-10-07 03:49:56,146 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:56,146 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:56,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:56,147 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:56,299 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:49:56,299 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:56,300 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:49:56,300 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:49:56,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:49:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:49:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:49:56,332 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-07 03:49:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:56,364 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. [2019-10-07 03:49:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:49:56,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-07 03:49:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:56,380 INFO L225 Difference]: With dead ends: 59 [2019-10-07 03:49:56,380 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 03:49:56,388 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:49:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 03:49:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-07 03:49:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 03:49:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-07 03:49:56,454 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 9 [2019-10-07 03:49:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-07 03:49:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:49:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-07 03:49:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:49:56,457 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:56,457 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:56,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1802396536, now seen corresponding path program 1 times [2019-10-07 03:49:56,460 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:56,460 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:56,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:56,461 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:56,655 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:49:56,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:56,656 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:49:56,656 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:49:56,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:49:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:49:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:49:56,659 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2019-10-07 03:49:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:56,764 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-10-07 03:49:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:49:56,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:49:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:56,767 INFO L225 Difference]: With dead ends: 32 [2019-10-07 03:49:56,767 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 03:49:56,769 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:49:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 03:49:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-10-07 03:49:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 03:49:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-07 03:49:56,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2019-10-07 03:49:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:56,780 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-07 03:49:56,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:49:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-07 03:49:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:49:56,781 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:56,781 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:56,782 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash -481985199, now seen corresponding path program 1 times [2019-10-07 03:49:56,783 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:56,783 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:56,783 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:56,783 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:56,917 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:49:56,917 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:56,917 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:49:56,917 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:49:56,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:49:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:49:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:49:56,919 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2019-10-07 03:49:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:57,093 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-10-07 03:49:57,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:49:57,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 03:49:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:57,095 INFO L225 Difference]: With dead ends: 52 [2019-10-07 03:49:57,095 INFO L226 Difference]: Without dead ends: 50 [2019-10-07 03:49:57,096 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:49:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-07 03:49:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-10-07 03:49:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 03:49:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-07 03:49:57,104 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2019-10-07 03:49:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:57,104 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-07 03:49:57,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:49:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-07 03:49:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:49:57,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:57,106 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:57,106 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:57,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -973296707, now seen corresponding path program 1 times [2019-10-07 03:49:57,107 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:57,107 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:57,107 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:57,107 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:57,400 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:49:57,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:57,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:57,405 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:49:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:57,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-07 03:49:57,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:57,647 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:49:57,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:57,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:57,672 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-07 03:49:57,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:57,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:57,685 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:49:57,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-07 03:49:57,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:57,802 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_33|], 4=[v_prenex_9]} [2019-10-07 03:49:58,198 INFO L235 Elim1Store]: Index analysis took 174 ms [2019-10-07 03:49:58,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:58,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 149 [2019-10-07 03:49:58,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:02,783 WARN L191 SmtUtils]: Spent 4.57 s on a formula simplification that was a NOOP. DAG size: 158 [2019-10-07 03:50:02,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:03,772 INFO L235 Elim1Store]: Index analysis took 194 ms [2019-10-07 03:50:03,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:03,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 277 [2019-10-07 03:50:03,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:07,096 WARN L191 SmtUtils]: Spent 3.30 s on a formula simplification that was a NOOP. DAG size: 155 [2019-10-07 03:50:07,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:07,107 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8, |v_#memory_$Pointer$.base_34|, v_prenex_10, |#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_1, |v_#memory_int_46|, |v_#memory_$Pointer$.offset_34|, v_prenex_7], 2=[|v_#memory_int_44|, |v_#memory_int_45|, |v_#memory_int_47|, v_prenex_3, v_prenex_5, |v_#memory_int_43|], 4=[v_prenex_4], 6=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-10-07 03:50:07,146 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:09,724 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification that was a NOOP. DAG size: 145 [2019-10-07 03:50:09,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:09,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:09,966 INFO L235 Elim1Store]: Index analysis took 160 ms [2019-10-07 03:50:09,969 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 139 treesize of output 115 [2019-10-07 03:50:09,969 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:12,261 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 140 [2019-10-07 03:50:12,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:12,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:12,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 194 [2019-10-07 03:50:12,369 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:13,823 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 135 [2019-10-07 03:50:13,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:13,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 115 treesize of output 107 [2019-10-07 03:50:13,996 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:15,264 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 128 [2019-10-07 03:50:15,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:15,321 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:16,419 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 116 [2019-10-07 03:50:16,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:16,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:16,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 170 [2019-10-07 03:50:16,606 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,278 WARN L191 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-10-07 03:50:17,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,292 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:17,945 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-10-07 03:50:17,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,946 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_34| vanished before elimination [2019-10-07 03:50:17,960 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,537 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-07 03:50:18,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:18,547 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:18,933 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-07 03:50:18,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:18,939 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,165 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-07 03:50:19,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:19,200 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-07 03:50:19,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2019-10-07 03:50:19,202 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,308 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-07 03:50:19,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,320 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,434 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-07 03:50:19,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:19,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 104 [2019-10-07 03:50:19,451 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,524 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:19,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:19,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:19,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2019-10-07 03:50:19,641 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2019-10-07 03:50:19,745 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2019-10-07 03:50:19,805 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, 18 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-07 03:50:19,855 INFO L221 ElimStorePlain]: Needed 20 recursive calls to eliminate 27 variables, input treesize:404, output treesize:72 [2019-10-07 03:50:19,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-07 03:50:19,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-07 03:50:19,972 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:50:19,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:50:20,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:20,052 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|, |#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_12, |v_#memory_$Pointer$.offset_35|, v_prenex_18, v_prenex_17, v_prenex_16], 2=[|v_#memory_int_44|, v_prenex_13, |v_#memory_int_43|], 3=[v_prenex_14, |v_#memory_int_46|], 4=[|v_#memory_int_45|], 6=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-10-07 03:50:20,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:20,911 WARN L191 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-10-07 03:50:20,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:21,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:50:21,159 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-10-07 03:50:21,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 218 treesize of output 216 [2019-10-07 03:50:21,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:22,203 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 158 [2019-10-07 03:50:22,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:22,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:50:22,576 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-10-07 03:50:22,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 214 [2019-10-07 03:50:22,578 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:24,853 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 155 [2019-10-07 03:50:24,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:24,889 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:26,315 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 142 [2019-10-07 03:50:26,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:26,350 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:26,692 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-10-07 03:50:26,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:26,706 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:26,928 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-10-07 03:50:26,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:26,928 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-07 03:50:26,928 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-10-07 03:50:26,935 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:27,138 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-07 03:50:27,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,146 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:27,417 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-10-07 03:50:27,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,425 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:27,642 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-07 03:50:27,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,653 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:27,769 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-07 03:50:27,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,775 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:27,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,873 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:27,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:27,983 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 184 [2019-10-07 03:50:27,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:27,985 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:28,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:28,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:28,084 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 147 [2019-10-07 03:50:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:28,085 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:28,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:28,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 16 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-10-07 03:50:28,136 INFO L221 ElimStorePlain]: Needed 15 recursive calls to eliminate 21 variables, input treesize:390, output treesize:149 [2019-10-07 03:50:28,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:28,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:28,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:28,215 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_42| vanished before elimination [2019-10-07 03:50:28,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:50:28,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:55, output treesize:1 [2019-10-07 03:50:28,221 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:50:28,221 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:50:28,244 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 03:50:28,244 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:50:28,250 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:50:28,258 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:50:28,259 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:50:28,351 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:51:51,396 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-10-07 03:51:51,558 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:51:51,563 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:51:51,563 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:51:51,564 INFO L193 IcfgInterpreter]: Reachable states at location L1027-3 satisfy 84#(or (and (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.offset 0)) (= main_~list~0.base main_~end~0.base)) (and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base))) [2019-10-07 03:51:51,564 INFO L193 IcfgInterpreter]: Reachable states at location L1028-4 satisfy 89#(or (and (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.offset 0)) (= main_~list~0.base main_~end~0.base)) (and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base))) [2019-10-07 03:51:51,564 INFO L193 IcfgInterpreter]: Reachable states at location L1027-4 satisfy 79#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base)) [2019-10-07 03:51:51,564 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 113#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:51:51,565 INFO L193 IcfgInterpreter]: Reachable states at location L1002-1 satisfy 69#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:51:51,565 INFO L193 IcfgInterpreter]: Reachable states at location L1002-3 satisfy 74#true [2019-10-07 03:51:51,565 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:51:51,565 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:51:51,565 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 118#(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:51:51,565 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:51:51,566 INFO L193 IcfgInterpreter]: Reachable states at location L1009-2 satisfy 109#(or (exists ((v_DerPreprocessor_19 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_19) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (exists ((v_main_~end~0.offset_37 Int) (v_prenex_83 Int) (v_prenex_82 Int) (v_main_~end~0.base_37 Int)) (or (and (or (and (= v_main_~end~0.base_37 main_~end~0.base) (= (+ main_~end~0.offset 4) v_main_~end~0.offset_37)) (and (= v_main_~end~0.offset_37 (+ |main_#t~malloc2.offset| 4)) (= v_main_~end~0.base_37 |main_#t~malloc2.base|)) (and (= v_main_~end~0.base_37 |main_#t~malloc2.base|) (= v_main_~end~0.offset_37 |main_#t~malloc2.offset|)) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_37) v_main_~end~0.offset_37) 0) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_37) v_main_~end~0.offset_37) |main_#t~malloc2.offset|)) (= |main_#t~malloc5.base| (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) |main_#t~malloc2.offset|)) (= 0 |main_#t~malloc2.offset|) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (= 1 (select |#valid| |main_#t~malloc5.base|)) (or (not (= v_main_~end~0.base_37 main_~end~0.base)) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_37) v_main_~end~0.offset_37) 0) (not (= main_~end~0.offset v_main_~end~0.offset_37))) (or (not (= v_main_~end~0.base_37 main_~end~0.base)) (not (= main_~end~0.offset v_main_~end~0.offset_37)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_37) v_main_~end~0.offset_37) 0)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0) (not (= |main_#t~malloc5.base| 0)) (or (and (= v_main_~end~0.base_37 main_~end~0.base) (= (+ main_~end~0.offset 4) v_main_~end~0.offset_37)) (and (= v_main_~end~0.offset_37 (+ |main_#t~malloc2.offset| 4)) (= v_main_~end~0.base_37 |main_#t~malloc2.base|)) (and (= v_main_~end~0.base_37 |main_#t~malloc2.base|) (= v_main_~end~0.offset_37 |main_#t~malloc2.offset|)) (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_37) v_main_~end~0.offset_37)) (and (= main_~end~0.offset v_main_~end~0.offset_37) (= v_main_~end~0.base_37 main_~end~0.base))) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| |main_#t~malloc5.base|)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0) (not (= |main_#t~malloc2.base| 0)) (= ~unnamed1~0~RED (select (select |#memory_int| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4))) (or (and (= v_main_~end~0.base_37 main_~end~0.base) (= (+ main_~end~0.offset 4) v_main_~end~0.offset_37)) (not (= v_main_~end~0.offset_37 |main_#t~malloc2.offset|)) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_37) v_main_~end~0.offset_37) |main_#t~malloc5.offset|) (not (= v_main_~end~0.base_37 |main_#t~malloc2.base|)) (and (= main_~end~0.offset v_main_~end~0.offset_37) (= v_main_~end~0.base_37 main_~end~0.base))) (= |main_#t~malloc5.base| main_~end~0.base) (= 0 |main_#t~malloc5.offset|) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) |main_#t~malloc2.offset|) |main_#t~malloc5.offset|) (or (and (= v_main_~end~0.base_37 main_~end~0.base) (= (+ main_~end~0.offset 4) v_main_~end~0.offset_37)) (not (= v_main_~end~0.offset_37 |main_#t~malloc2.offset|)) (= |main_#t~malloc5.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_37) v_main_~end~0.offset_37)) (not (= v_main_~end~0.base_37 |main_#t~malloc2.base|)) (and (= main_~end~0.offset v_main_~end~0.offset_37) (= v_main_~end~0.base_37 main_~end~0.base))) (= 8 (select |#length| |main_#t~malloc2.base|)) (= (select |#length| |main_#t~malloc5.base|) 8) (< |#StackHeapBarrier| |main_#t~malloc5.base|) (= main_~end~0.offset |main_#t~malloc5.offset|)) (and (not (= |main_#t~malloc2.base| 0)) (or (and (= |main_#t~malloc2.base| v_prenex_83) (= v_prenex_82 |main_#t~malloc2.offset|)) (= (select (select |#memory_$Pointer$.offset| v_prenex_83) v_prenex_82) |main_#t~malloc2.offset|) (and (= (+ |main_#t~malloc2.offset| 4) v_prenex_82) (= |main_#t~malloc2.base| v_prenex_83))) (= 0 |main_#t~malloc2.offset|) (or (not (= |main_#t~malloc2.base| v_prenex_83)) (not (= v_prenex_82 |main_#t~malloc2.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_83) v_prenex_82))) (= main_~end~0.offset |main_#t~malloc2.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4))) (= |main_#t~malloc2.base| main_~end~0.base) (or (not (= |main_#t~malloc2.base| v_prenex_83)) (= (select (select |#memory_$Pointer$.base| v_prenex_83) v_prenex_82) 0) (not (= v_prenex_82 |main_#t~malloc2.offset|))) (= 8 (select |#length| |main_#t~malloc2.base|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) |main_#t~malloc2.offset|) 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) |main_#t~malloc2.offset|) 0) (or (and (= |main_#t~malloc2.base| v_prenex_83) (= v_prenex_82 |main_#t~malloc2.offset|)) (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_prenex_83) v_prenex_82)) (and (= (+ |main_#t~malloc2.offset| 4) v_prenex_82) (= |main_#t~malloc2.base| v_prenex_83))))))) [2019-10-07 03:51:51,566 INFO L193 IcfgInterpreter]: Reachable states at location L1028 satisfy 94#(or (and (= main_~list~0.offset main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base)) (and (= main_~list~0.offset main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|) (not (= main_~end~0.offset 0)) (= main_~list~0.base main_~end~0.base))) [2019-10-07 03:51:51,566 INFO L193 IcfgInterpreter]: Reachable states at location mainErr1ASSERT_VIOLATIONERROR_FUNCTION satisfy 104#(or (and (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.offset 0)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))) (and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)))) [2019-10-07 03:51:51,567 INFO L193 IcfgInterpreter]: Reachable states at location L1028-1 satisfy 99#(or (and (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.offset 0)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))) (and (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)))) [2019-10-07 03:51:52,098 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:51:52,098 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 22 [2019-10-07 03:51:52,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 03:51:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 03:51:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-07 03:51:52,101 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 22 states. [2019-10-07 03:51:52,482 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 180 [2019-10-07 03:51:52,749 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 187 [2019-10-07 03:51:53,919 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 207 [2019-10-07 03:51:54,335 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 213 [2019-10-07 03:51:56,852 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-07 03:51:57,124 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 183 [2019-10-07 03:51:57,379 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-10-07 03:51:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:51:58,090 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-10-07 03:51:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 03:51:58,090 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 15 [2019-10-07 03:51:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:51:58,092 INFO L225 Difference]: With dead ends: 65 [2019-10-07 03:51:58,092 INFO L226 Difference]: Without dead ends: 63 [2019-10-07 03:51:58,093 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2019-10-07 03:51:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-07 03:51:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 25. [2019-10-07 03:51:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 03:51:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 03:51:58,101 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2019-10-07 03:51:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:51:58,101 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 03:51:58,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 03:51:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 03:51:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 03:51:58,102 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:51:58,102 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:51:58,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:51:58,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:51:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:51:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1509326664, now seen corresponding path program 1 times [2019-10-07 03:51:58,310 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:51:58,310 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:51:58,311 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:51:58,311 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:51:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:51:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:51:58,437 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:51:58,438 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:51:58,438 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:51:58,438 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:51:58,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:51:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:51:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:51:58,439 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2019-10-07 03:51:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:51:58,680 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-07 03:51:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:51:58,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 03:51:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:51:58,684 INFO L225 Difference]: With dead ends: 40 [2019-10-07 03:51:58,684 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 03:51:58,684 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:51:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 03:51:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-07 03:51:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 03:51:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-07 03:51:58,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 17 [2019-10-07 03:51:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:51:58,693 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-07 03:51:58,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:51:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-07 03:51:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 03:51:58,693 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:51:58,694 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:51:58,694 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:51:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:51:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash 781052852, now seen corresponding path program 1 times [2019-10-07 03:51:58,695 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:51:58,695 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:51:58,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:51:58,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:51:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:51:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:51:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:51:58,743 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:51:58,743 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:51:58,743 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:51:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:51:58,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 03:51:58,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:51:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:51:58,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:51:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:51:58,939 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:51:58,941 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 03:51:58,941 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:51:58,941 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:51:58,942 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:51:58,942 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:51:58,979 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:51:59,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:51:59,119 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:51:59,119 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:51:59,119 INFO L193 IcfgInterpreter]: Reachable states at location L1027-3 satisfy 58#(or (and (not (= main_~end~0.offset 0)) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (and (not (= 0 main_~end~0.base)) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))))) [2019-10-07 03:51:59,120 INFO L193 IcfgInterpreter]: Reachable states at location L1028-4 satisfy 63#(or (and (not (= main_~end~0.offset 0)) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (and (not (= 0 main_~end~0.base)) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))))) [2019-10-07 03:51:59,120 INFO L193 IcfgInterpreter]: Reachable states at location L1035-1 satisfy 132#(and (= 0 main_~end~0.base) (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_47 Int) (v_main_~end~0.base_47 Int)) (or (and (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_47) v_main_~end~0.offset_47)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_47) v_main_~end~0.offset_47) main_~end~0.base) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_47) (+ v_main_~end~0.offset_47 4))) (not (= v_main_~end~0.offset_47 0))) (and (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_47) v_main_~end~0.offset_47)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_47) v_main_~end~0.offset_47) main_~end~0.base) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_47) (+ v_main_~end~0.offset_47 4))) (not (= v_main_~end~0.base_47 0))))) (<= 0 main_~end~0.base) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= main_~end~0.base 0)) [2019-10-07 03:51:59,120 INFO L193 IcfgInterpreter]: Reachable states at location L1027-4 satisfy 53#(exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:51:59,120 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:51:59,121 INFO L193 IcfgInterpreter]: Reachable states at location L1002-1 satisfy 43#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:51:59,121 INFO L193 IcfgInterpreter]: Reachable states at location L1032 satisfy 122#(or (and (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|) (not (= 0 main_~end~0.base))) (and (not (= main_~end~0.offset 0)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem8|))) [2019-10-07 03:51:59,121 INFO L193 IcfgInterpreter]: Reachable states at location L1002-3 satisfy 48#(exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:51:59,121 INFO L193 IcfgInterpreter]: Reachable states at location L1032-1 satisfy 142#(or (and (not (= main_~end~0.offset 0)) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~RED))) (and (not (= 0 main_~end~0.base)) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~RED)))) [2019-10-07 03:51:59,121 INFO L193 IcfgInterpreter]: Reachable states at location L1035-4 satisfy 127#(exists ((v_main_~end~0.offset_47 Int) (v_main_~end~0.base_47 Int)) (or (and (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_47) v_main_~end~0.offset_47)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_47) v_main_~end~0.offset_47) main_~end~0.base) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_47) (+ v_main_~end~0.offset_47 4))) (not (= v_main_~end~0.offset_47 0))) (and (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_47) v_main_~end~0.offset_47)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_47) v_main_~end~0.offset_47) main_~end~0.base) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_47) (+ v_main_~end~0.offset_47 4))) (not (= v_main_~end~0.base_47 0))))) [2019-10-07 03:51:59,122 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:51:59,122 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:51:59,122 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:51:59,123 INFO L193 IcfgInterpreter]: Reachable states at location L1030-1 satisfy 117#true [2019-10-07 03:51:59,123 INFO L193 IcfgInterpreter]: Reachable states at location mainErr2ASSERT_VIOLATIONERROR_FUNCTION satisfy 137#(and (= 0 main_~end~0.base) (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_47 Int) (v_main_~end~0.base_47 Int)) (or (and (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_47) v_main_~end~0.offset_47)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_47) v_main_~end~0.offset_47) main_~end~0.base) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_47) (+ v_main_~end~0.offset_47 4))) (not (= v_main_~end~0.offset_47 0))) (and (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_47) v_main_~end~0.offset_47)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_47) v_main_~end~0.offset_47) main_~end~0.base) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_47) (+ v_main_~end~0.offset_47 4))) (not (= v_main_~end~0.base_47 0))))) (<= 0 main_~end~0.base) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= main_~end~0.base 0)) [2019-10-07 03:51:59,126 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:51:59,126 INFO L193 IcfgInterpreter]: Reachable states at location L1009-2 satisfy 38#(exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:51:59,126 INFO L193 IcfgInterpreter]: Reachable states at location L1028 satisfy 68#(or (and (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|) (not (= 0 main_~end~0.base)) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (and (not (= main_~end~0.offset 0)) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|) (exists ((v_DerPreprocessor_70 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))))) [2019-10-07 03:51:59,127 INFO L193 IcfgInterpreter]: Reachable states at location L1028-3 satisfy 73#(exists ((v_DerPreprocessor_70 Int)) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (not (= main_~end~0.offset 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= |#NULL.offset| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_70) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) [2019-10-07 03:51:59,792 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:51:59,792 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 12] total 18 [2019-10-07 03:51:59,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 03:51:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 03:51:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:51:59,794 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2019-10-07 03:52:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:52:01,016 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-10-07 03:52:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 03:52:01,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-07 03:52:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:52:01,017 INFO L225 Difference]: With dead ends: 52 [2019-10-07 03:52:01,018 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 03:52:01,019 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-10-07 03:52:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 03:52:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-07 03:52:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 03:52:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-07 03:52:01,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2019-10-07 03:52:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:52:01,026 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-07 03:52:01,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 03:52:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-07 03:52:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:52:01,027 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:52:01,027 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:52:01,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:01,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:52:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:52:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1761995720, now seen corresponding path program 1 times [2019-10-07 03:52:01,233 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:52:01,233 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:01,233 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:01,234 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:52:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:01,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:01,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:52:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:01,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-07 03:52:01,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:52:03,039 WARN L191 SmtUtils]: Spent 986.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-07 03:52:04,172 WARN L191 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-10-07 03:52:05,326 WARN L191 SmtUtils]: Spent 963.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-07 03:52:06,242 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-10-07 03:52:06,915 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-07 03:52:07,322 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-07 03:52:07,637 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-07 03:52:07,872 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-07 03:52:08,043 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-07 03:52:08,270 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-07 03:52:09,046 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:52:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:09,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:52:10,631 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-10-07 03:52:11,507 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2019-10-07 03:52:12,089 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2019-10-07 03:52:12,683 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-10-07 03:52:13,060 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-10-07 03:52:13,653 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2019-10-07 03:52:13,851 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-07 03:52:14,303 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 139 [2019-10-07 03:52:14,761 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 145 [2019-10-07 03:52:15,194 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 148 [2019-10-07 03:52:15,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:15,397 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:52:15,403 INFO L168 Benchmark]: Toolchain (without parser) took 141100.31 ms. Allocated memory was 140.0 MB in the beginning and 323.0 MB in the end (delta: 183.0 MB). Free memory was 101.8 MB in the beginning and 110.2 MB in the end (delta: -8.4 MB). Peak memory consumption was 195.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:15,403 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:52:15,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.91 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 101.6 MB in the beginning and 173.0 MB in the end (delta: -71.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:15,404 INFO L168 Benchmark]: Boogie Preprocessor took 73.59 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 170.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:15,404 INFO L168 Benchmark]: RCFGBuilder took 874.00 ms. Allocated memory is still 206.6 MB. Free memory was 170.3 MB in the beginning and 114.8 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:15,405 INFO L168 Benchmark]: TraceAbstraction took 139370.22 ms. Allocated memory was 206.6 MB in the beginning and 323.0 MB in the end (delta: 116.4 MB). Free memory was 114.8 MB in the beginning and 110.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:15,406 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.91 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 101.6 MB in the beginning and 173.0 MB in the end (delta: -71.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.59 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 170.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.00 ms. Allocated memory is still 206.6 MB. Free memory was 170.3 MB in the beginning and 114.8 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139370.22 ms. Allocated memory was 206.6 MB in the beginning and 323.0 MB in the end (delta: 116.4 MB). Free memory was 114.8 MB in the beginning and 110.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 142.3 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:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...