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/dll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:56:18,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:56:18,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:56:18,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:56:18,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:56:18,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:56:18,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:56:18,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:56:18,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:56:18,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:56:18,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:56:18,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:56:18,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:56:18,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:56:18,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:56:18,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:56:18,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:56:18,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:56:18,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:56:18,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:56:18,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:56:18,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:56:18,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:56:18,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:56:18,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:56:18,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:56:18,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:56:19,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:56:19,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:56:19,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:56:19,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:56:19,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:56:19,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:56:19,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:56:19,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:56:19,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:56:19,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:56:19,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:56:19,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:56:19,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:56:19,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:56:19,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:56:19,035 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:56:19,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:56:19,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:56:19,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:56:19,038 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:56:19,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:56:19,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:56:19,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:56:19,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:56:19,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:56:19,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:56:19,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:56:19,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:56:19,041 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:56:19,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:56:19,041 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:56:19,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:56:19,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:56:19,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:56:19,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:56:19,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:56:19,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:56:19,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:56:19,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:56:19,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:56:19,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:56:19,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:56:19,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:56:19,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:56:19,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:56:19,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:56:19,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:56:19,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:56:19,369 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:56:19,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-13 21:56:19,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb59b4cf/88954ccf0fdc49c8b9310f11cf7926c3/FLAGae2b6d367 [2019-10-13 21:56:19,955 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:56:19,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-13 21:56:19,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb59b4cf/88954ccf0fdc49c8b9310f11cf7926c3/FLAGae2b6d367 [2019-10-13 21:56:20,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb59b4cf/88954ccf0fdc49c8b9310f11cf7926c3 [2019-10-13 21:56:20,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:56:20,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:56:20,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:56:20,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:56:20,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:56:20,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad58572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20, skipping insertion in model container [2019-10-13 21:56:20,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,279 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:56:20,323 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:56:20,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:56:20,771 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:56:20,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:56:20,883 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:56:20,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20 WrapperNode [2019-10-13 21:56:20,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:56:20,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:56:20,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:56:20,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:56:20,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... [2019-10-13 21:56:20,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:56:20,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:56:20,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:56:20,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:56:20,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:56:21,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:56:21,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:56:21,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:56:21,022 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 21:56:21,022 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 21:56:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 21:56:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 21:56:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 21:56:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 21:56:21,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 21:56:21,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 21:56:21,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 21:56:21,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 21:56:21,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 21:56:21,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 21:56:21,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 21:56:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 21:56:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 21:56:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 21:56:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 21:56:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 21:56:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 21:56:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 21:56:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 21:56:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 21:56:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 21:56:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 21:56:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 21:56:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 21:56:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 21:56:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 21:56:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 21:56:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 21:56:21,032 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 21:56:21,032 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 21:56:21,032 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 21:56:21,032 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 21:56:21,032 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 21:56:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 21:56:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 21:56:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 21:56:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 21:56:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 21:56:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 21:56:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:56:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 21:56:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 21:56:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 21:56:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:56:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 21:56:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 21:56:21,039 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 21:56:21,039 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 21:56:21,039 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 21:56:21,039 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 21:56:21,040 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 21:56:21,040 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 21:56:21,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 21:56:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 21:56:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 21:56:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 21:56:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 21:56:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 21:56:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 21:56:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 21:56:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 21:56:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 21:56:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 21:56:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 21:56:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 21:56:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 21:56:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 21:56:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 21:56:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 21:56:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 21:56:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:56:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:56:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:56:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:56:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:56:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:56:21,906 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:56:21,906 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-13 21:56:21,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:21 BoogieIcfgContainer [2019-10-13 21:56:21,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:56:21,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:56:21,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:56:21,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:56:21,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:56:20" (1/3) ... [2019-10-13 21:56:21,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e15801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:56:21, skipping insertion in model container [2019-10-13 21:56:21,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:20" (2/3) ... [2019-10-13 21:56:21,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e15801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:56:21, skipping insertion in model container [2019-10-13 21:56:21,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:21" (3/3) ... [2019-10-13 21:56:21,916 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-13 21:56:21,926 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:56:21,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-13 21:56:21,946 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-13 21:56:21,973 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:56:21,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:56:21,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:56:21,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:56:21,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:56:21,977 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:56:21,977 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:56:21,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:56:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-13 21:56:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-13 21:56:22,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:22,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:22,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash 299738079, now seen corresponding path program 1 times [2019-10-13 21:56:22,021 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:22,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146345085] [2019-10-13 21:56:22,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:22,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146345085] [2019-10-13 21:56:22,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:22,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:56:22,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824212976] [2019-10-13 21:56:22,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:56:22,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:22,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:56:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:56:22,270 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-13 21:56:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:22,311 INFO L93 Difference]: Finished difference Result 89 states and 139 transitions. [2019-10-13 21:56:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:56:22,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-13 21:56:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:22,327 INFO L225 Difference]: With dead ends: 89 [2019-10-13 21:56:22,327 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:56:22,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:56:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:56:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-13 21:56:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:56:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-13 21:56:22,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 9 [2019-10-13 21:56:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:22,386 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-13 21:56:22,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:56:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-13 21:56:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:56:22,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:22,388 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:22,388 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 644598331, now seen corresponding path program 1 times [2019-10-13 21:56:22,390 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:22,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701604268] [2019-10-13 21:56:22,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:22,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701604268] [2019-10-13 21:56:22,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:22,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:56:22,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579954316] [2019-10-13 21:56:22,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:56:22,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:56:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:56:22,645 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-10-13 21:56:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:22,970 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-13 21:56:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:56:22,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-13 21:56:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:22,972 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:56:22,972 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 21:56:22,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:56:22,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 21:56:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-13 21:56:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 21:56:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-13 21:56:22,979 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-13 21:56:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:22,979 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-13 21:56:22,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:56:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-13 21:56:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:56:22,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:22,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:22,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 639051341, now seen corresponding path program 1 times [2019-10-13 21:56:22,981 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:22,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894908354] [2019-10-13 21:56:22,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:23,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894908354] [2019-10-13 21:56:23,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:23,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:56:23,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544017069] [2019-10-13 21:56:23,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:56:23,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:56:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:56:23,047 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-10-13 21:56:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:23,187 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-10-13 21:56:23,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:56:23,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-13 21:56:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:23,189 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:56:23,189 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 21:56:23,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:56:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 21:56:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-13 21:56:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:56:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-13 21:56:23,200 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 10 [2019-10-13 21:56:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:23,201 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-13 21:56:23,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:56:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-13 21:56:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:56:23,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:23,202 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:23,203 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash 434039850, now seen corresponding path program 1 times [2019-10-13 21:56:23,204 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:23,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736359733] [2019-10-13 21:56:23,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:23,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:23,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:23,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736359733] [2019-10-13 21:56:23,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:23,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:56:23,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231309935] [2019-10-13 21:56:23,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:56:23,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:23,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:56:23,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:56:23,385 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-10-13 21:56:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:23,588 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-13 21:56:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:56:23,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:56:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:23,591 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:56:23,591 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:56:23,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:56:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:56:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 21:56:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:56:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-13 21:56:23,597 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 13 [2019-10-13 21:56:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:23,598 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-13 21:56:23,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:56:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-13 21:56:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:56:23,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:23,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:23,599 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1607525391, now seen corresponding path program 1 times [2019-10-13 21:56:23,599 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:23,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121703100] [2019-10-13 21:56:23,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:23,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:23,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:23,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121703100] [2019-10-13 21:56:23,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:23,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:56:23,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618653105] [2019-10-13 21:56:23,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:56:23,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:56:23,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:56:23,734 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2019-10-13 21:56:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:24,127 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-10-13 21:56:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:56:24,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-13 21:56:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:24,129 INFO L225 Difference]: With dead ends: 62 [2019-10-13 21:56:24,129 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:56:24,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:56:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:56:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2019-10-13 21:56:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:56:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-13 21:56:24,138 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 13 [2019-10-13 21:56:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:24,138 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-13 21:56:24,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:56:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-13 21:56:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:56:24,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:24,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:24,140 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 500595918, now seen corresponding path program 1 times [2019-10-13 21:56:24,141 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:24,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876607632] [2019-10-13 21:56:24,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:24,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:24,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876607632] [2019-10-13 21:56:24,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:24,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:56:24,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847818762] [2019-10-13 21:56:24,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:56:24,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:24,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:56:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:56:24,266 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-10-13 21:56:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:24,353 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-10-13 21:56:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:56:24,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 21:56:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:24,354 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:56:24,355 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:56:24,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:56:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:56:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-13 21:56:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 21:56:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-13 21:56:24,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-10-13 21:56:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:24,362 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-13 21:56:24,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:56:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-13 21:56:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:56:24,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:24,364 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:24,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2116307816, now seen corresponding path program 1 times [2019-10-13 21:56:24,365 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:24,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344296914] [2019-10-13 21:56:24,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:24,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:24,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:24,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344296914] [2019-10-13 21:56:24,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:56:24,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:56:24,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088586130] [2019-10-13 21:56:24,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:56:24,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:24,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:56:24,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:56:24,503 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2019-10-13 21:56:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:24,677 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-10-13 21:56:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:56:24,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 21:56:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:24,681 INFO L225 Difference]: With dead ends: 57 [2019-10-13 21:56:24,681 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 21:56:24,681 INFO L600 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-13 21:56:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 21:56:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-13 21:56:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:56:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-13 21:56:24,687 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 17 [2019-10-13 21:56:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:24,687 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-13 21:56:24,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:56:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-13 21:56:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:56:24,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:24,688 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:56:24,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash 17922409, now seen corresponding path program 1 times [2019-10-13 21:56:24,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:24,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984198156] [2019-10-13 21:56:24,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:24,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:24,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:24,753 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-13 21:56:24,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984198156] [2019-10-13 21:56:24,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114936723] [2019-10-13 21:56:24,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:56:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:24,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:56:24,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:56:24,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:24,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:24,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:24,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-13 21:56:24,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:24,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:24,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:24,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:24,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:24,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-13 21:56:24,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:24,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:24,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:56:24,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-13 21:56:25,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:25,040 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-13 21:56:25,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:25,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:25,053 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-13 21:56:25,054 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 24 treesize of output 10 [2019-10-13 21:56:25,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:25,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:25,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:56:25,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-13 21:56:25,082 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-13 21:56:25,082 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:56:25,145 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-13 21:56:25,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126368829] [2019-10-13 21:56:25,170 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:56:25,171 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:56:25,176 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:56:25,184 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:56:25,185 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:56:25,272 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:56:25,818 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:56:25,827 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:56:25,827 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:56:25,828 INFO L193 IcfgInterpreter]: Reachable states at location L1038-4 satisfy 53#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) [2019-10-13 21:56:25,828 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-13 21:56:25,829 INFO L193 IcfgInterpreter]: Reachable states at location L1045-1 satisfy 132#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base) (exists ((v_main_~end~0.offset_44 Int) (v_main_~end~0.base_44 Int)) (or (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.offset_44 main_~null~0.offset)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.base_44 main_~null~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8))))))) [2019-10-13 21:56:25,829 INFO L193 IcfgInterpreter]: Reachable states at location mainErr5ASSERT_VIOLATIONERROR_FUNCTION satisfy 137#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base) (exists ((v_main_~end~0.offset_44 Int) (v_main_~end~0.base_44 Int)) (or (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.offset_44 main_~null~0.offset)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.base_44 main_~null~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8))))))) [2019-10-13 21:56:25,829 INFO L193 IcfgInterpreter]: Reachable states at location L1042 satisfy 122#(or (and (= |main_#t~mem13| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~null~0.base main_~end~0.base))) (and (= |main_#t~mem13| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.offset main_~null~0.offset)))) [2019-10-13 21:56:25,829 INFO L193 IcfgInterpreter]: Reachable states at location L1042-1 satisfy 142#(or (and (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (not (= main_~end~0.offset main_~null~0.offset))) (and (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (not (= main_~null~0.base main_~end~0.base)))) [2019-10-13 21:56:25,830 INFO L193 IcfgInterpreter]: Reachable states at location L1045-4 satisfy 127#(exists ((v_main_~end~0.offset_44 Int) (v_main_~end~0.base_44 Int)) (or (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.offset_44 main_~null~0.offset)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.base_44 main_~null~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))))) [2019-10-13 21:56:25,830 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:25,830 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 21:56:25,830 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-13 21:56:25,831 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:56:25,831 INFO L193 IcfgInterpreter]: Reachable states at location L1008-1 satisfy 43#(and (<= 0 (+ |main_#t~nondet2| 2147483648)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (<= |main_#t~nondet2| 2147483647)) [2019-10-13 21:56:25,831 INFO L193 IcfgInterpreter]: Reachable states at location L1039 satisfy 68#(or (and (= |main_#t~mem12| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (not (= main_~null~0.base main_~end~0.base))) (and (= |main_#t~mem12| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.offset main_~null~0.offset)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))))) [2019-10-13 21:56:25,832 INFO L193 IcfgInterpreter]: Reachable states at location L1040-1 satisfy 117#true [2019-10-13 21:56:25,834 INFO L193 IcfgInterpreter]: Reachable states at location L1031-4 satisfy 38#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) [2019-10-13 21:56:25,834 INFO L193 IcfgInterpreter]: Reachable states at location L1008-3 satisfy 48#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) [2019-10-13 21:56:25,835 INFO L193 IcfgInterpreter]: Reachable states at location L1039-3 satisfy 73#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (not (= main_~null~0.base main_~end~0.base)) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0))) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (not (= main_~end~0.offset main_~null~0.offset)) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0))))) [2019-10-13 21:56:25,835 INFO L193 IcfgInterpreter]: Reachable states at location L1038-3 satisfy 58#(or (and (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (not (= main_~null~0.base main_~end~0.base))) (and (not (= main_~end~0.offset main_~null~0.offset)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))))) [2019-10-13 21:56:25,836 INFO L193 IcfgInterpreter]: Reachable states at location L1039-4 satisfy 63#(or (and (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (not (= main_~null~0.base main_~end~0.base))) (and (not (= main_~end~0.offset main_~null~0.offset)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))))) [2019-10-13 21:56:26,642 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2019-10-13 21:56:35,273 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:56:35,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 13] total 22 [2019-10-13 21:56:35,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792502382] [2019-10-13 21:56:35,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:56:35,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:56:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=373, Unknown=4, NotChecked=0, Total=462 [2019-10-13 21:56:35,277 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 22 states. [2019-10-13 21:57:06,608 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-13 21:57:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:09,135 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-10-13 21:57:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:57:09,136 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2019-10-13 21:57:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:09,137 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:57:09,137 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 21:57:09,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=177, Invalid=810, Unknown=5, NotChecked=0, Total=992 [2019-10-13 21:57:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 21:57:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2019-10-13 21:57:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:57:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-13 21:57:09,144 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 20 [2019-10-13 21:57:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:09,144 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-13 21:57:09,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:57:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-13 21:57:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:57:09,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:09,146 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:09,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:57:09,348 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:09,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1465232090, now seen corresponding path program 1 times [2019-10-13 21:57:09,349 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:09,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508389695] [2019-10-13 21:57:09,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:09,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:09,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:09,775 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27