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 -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:29:41,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:29:41,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:29:41,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:29:41,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:29:41,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:29:41,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:29:41,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:29:41,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:29:41,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:29:41,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:29:41,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:29:41,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:29:41,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:29:41,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:29:41,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:29:41,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:29:41,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:29:41,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:29:41,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:29:41,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:29:41,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:29:41,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:29:41,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:29:41,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:29:41,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:29:41,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:29:41,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:29:41,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:29:41,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:29:41,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:29:41,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:29:41,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:29:41,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:29:41,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:29:41,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:29:41,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:29:41,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:29:41,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:29:41,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:29:41,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:29:41,107 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-09-16 16:29:41,122 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:29:41,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:29:41,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:29:41,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:29:41,124 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:29:41,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:29:41,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:29:41,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:29:41,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:29:41,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:29:41,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:29:41,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:29:41,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:29:41,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:29:41,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:29:41,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:29:41,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:29:41,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:29:41,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:29:41,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:29:41,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:29:41,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:29:41,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:29:41,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:29:41,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:29:41,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:29:41,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:29:41,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:29:41,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:29:41,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:29:41,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:29:41,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:29:41,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:29:41,179 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:29:41,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i [2019-09-16 16:29:41,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0da948d/8948a8b1759f4d48a6433660c434d715/FLAG9ee600644 [2019-09-16 16:29:41,832 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:29:41,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2019-09-16 16:29:41,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0da948d/8948a8b1759f4d48a6433660c434d715/FLAG9ee600644 [2019-09-16 16:29:42,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0da948d/8948a8b1759f4d48a6433660c434d715 [2019-09-16 16:29:42,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:29:42,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:29:42,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:29:42,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:29:42,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:29:42,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329dc61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42, skipping insertion in model container [2019-09-16 16:29:42,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,162 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:29:42,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:29:42,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:29:42,629 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:29:42,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:29:42,737 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:29:42,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42 WrapperNode [2019-09-16 16:29:42,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:29:42,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:29:42,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:29:42,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:29:42,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (1/1) ... [2019-09-16 16:29:42,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:29:42,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:29:42,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:29:42,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:29:42,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (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-09-16 16:29:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:29:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:29:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-16 16:29:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-16 16:29:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-16 16:29:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-16 16:29:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-09-16 16:29:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-09-16 16:29:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2019-09-16 16:29:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2019-09-16 16:29:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:29:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:29:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-16 16:29:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-16 16:29:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:29:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:29:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:29:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:29:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:29:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:29:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:29:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:29:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:29:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:29:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:29:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:29:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:29:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:29:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:29:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:29:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:29:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:29:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:29:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:29:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:29:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:29:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:29:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:29:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:29:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:29:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:29:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:29:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:29:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:29:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:29:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:29:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:29:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:29:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:29:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:29:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:29:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:29:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:29:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:29:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:29:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:29:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:29:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:29:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:29:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:29:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:29:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:29:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:29:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:29:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:29:42,929 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:29:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:29:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:29:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:29:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:29:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:29:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:29:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:29:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:29:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-16 16:29:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-16 16:29:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:29:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:29:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:29:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2019-09-16 16:29:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:29:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:29:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:29:43,368 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-16 16:29:43,531 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:29:43,531 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-16 16:29:43,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:29:43 BoogieIcfgContainer [2019-09-16 16:29:43,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:29:43,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:29:43,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:29:43,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:29:43,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:29:42" (1/3) ... [2019-09-16 16:29:43,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3220f52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:29:43, skipping insertion in model container [2019-09-16 16:29:43,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:42" (2/3) ... [2019-09-16 16:29:43,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3220f52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:29:43, skipping insertion in model container [2019-09-16 16:29:43,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:29:43" (3/3) ... [2019-09-16 16:29:43,541 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2019-09-16 16:29:43,551 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:29:43,563 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:29:43,576 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:29:43,601 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:29:43,602 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:29:43,602 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:29:43,602 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:29:43,602 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:29:43,603 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:29:43,603 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:29:43,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:29:43,603 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:29:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-09-16 16:29:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:29:43,628 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:43,629 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:43,631 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1303429635, now seen corresponding path program 1 times [2019-09-16 16:29:43,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:43,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:43,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:29:43,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:29:43,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:29:43,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:29:43,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:29:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:29:43,823 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2019-09-16 16:29:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:43,852 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2019-09-16 16:29:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:29:43,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2019-09-16 16:29:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:43,864 INFO L225 Difference]: With dead ends: 86 [2019-09-16 16:29:43,865 INFO L226 Difference]: Without dead ends: 38 [2019-09-16 16:29:43,868 INFO L636 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-09-16 16:29:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-16 16:29:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-16 16:29:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-16 16:29:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-09-16 16:29:43,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2019-09-16 16:29:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:43,913 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-09-16 16:29:43,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:29:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-09-16 16:29:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:29:43,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:43,915 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:43,915 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2048382207, now seen corresponding path program 1 times [2019-09-16 16:29:43,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:43,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:43,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:29:44,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:29:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:29:44,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:29:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:29:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:29:44,029 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2019-09-16 16:29:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:44,132 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-09-16 16:29:44,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:29:44,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-16 16:29:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:44,135 INFO L225 Difference]: With dead ends: 68 [2019-09-16 16:29:44,135 INFO L226 Difference]: Without dead ends: 43 [2019-09-16 16:29:44,138 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:29:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-16 16:29:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-16 16:29:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:29:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-16 16:29:44,156 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2019-09-16 16:29:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:44,156 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-16 16:29:44,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:29:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-16 16:29:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:29:44,159 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:44,160 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:44,160 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:44,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1036290808, now seen corresponding path program 1 times [2019-09-16 16:29:44,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:44,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:44,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:29:44,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:29:44,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:29:44,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:29:44,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:29:44,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:29:44,264 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2019-09-16 16:29:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:44,308 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-09-16 16:29:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:29:44,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:29:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:44,312 INFO L225 Difference]: With dead ends: 73 [2019-09-16 16:29:44,312 INFO L226 Difference]: Without dead ends: 43 [2019-09-16 16:29:44,314 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:29:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-16 16:29:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-16 16:29:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-16 16:29:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-16 16:29:44,325 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2019-09-16 16:29:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:44,326 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-16 16:29:44,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:29:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-16 16:29:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:29:44,331 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:44,331 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:44,331 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1569732746, now seen corresponding path program 1 times [2019-09-16 16:29:44,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:44,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:29:44,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:44,480 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:29:44,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:44,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:29:44,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:29:44,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:29:44,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-16 16:29:44,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:29:44,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:29:44,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:29:44,723 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 6 states. [2019-09-16 16:29:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:44,805 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-09-16 16:29:44,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:29:44,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-16 16:29:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:44,807 INFO L225 Difference]: With dead ends: 73 [2019-09-16 16:29:44,807 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 16:29:44,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:29:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 16:29:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-09-16 16:29:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-16 16:29:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-09-16 16:29:44,814 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2019-09-16 16:29:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:44,815 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-09-16 16:29:44,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:29:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-09-16 16:29:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:29:44,816 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:44,816 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:44,816 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 649760861, now seen corresponding path program 1 times [2019-09-16 16:29:44,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-16 16:29:44,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:29:44,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:29:44,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:29:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:29:44,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:29:44,924 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2019-09-16 16:29:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:44,972 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-09-16 16:29:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:29:44,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-09-16 16:29:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:44,975 INFO L225 Difference]: With dead ends: 67 [2019-09-16 16:29:44,975 INFO L226 Difference]: Without dead ends: 54 [2019-09-16 16:29:44,976 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:29:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-16 16:29:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-09-16 16:29:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-16 16:29:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-09-16 16:29:44,991 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2019-09-16 16:29:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:44,994 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-09-16 16:29:44,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:29:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-09-16 16:29:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 16:29:44,997 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:44,998 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:44,998 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash 741026599, now seen corresponding path program 1 times [2019-09-16 16:29:44,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-16 16:29:45,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:45,148 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:29:45,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:45,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:29:45,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-16 16:29:45,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:29:45,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-16 16:29:45,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:29:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:29:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:29:45,353 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2019-09-16 16:29:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:45,494 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-09-16 16:29:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:29:45,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-09-16 16:29:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:45,496 INFO L225 Difference]: With dead ends: 77 [2019-09-16 16:29:45,496 INFO L226 Difference]: Without dead ends: 64 [2019-09-16 16:29:45,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:29:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-16 16:29:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-09-16 16:29:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-16 16:29:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-16 16:29:45,505 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2019-09-16 16:29:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:45,505 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-16 16:29:45,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:29:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-16 16:29:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 16:29:45,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:45,508 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:45,508 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash -362718223, now seen corresponding path program 2 times [2019-09-16 16:29:45,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:45,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:45,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-16 16:29:45,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:45,593 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:29:45,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:29:45,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:29:45,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:29:45,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:29:45,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:29:45,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:29:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-09-16 16:29:45,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:29:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:29:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:29:45,763 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-09-16 16:29:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:45,916 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-09-16 16:29:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:29:45,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-09-16 16:29:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:45,919 INFO L225 Difference]: With dead ends: 81 [2019-09-16 16:29:45,919 INFO L226 Difference]: Without dead ends: 60 [2019-09-16 16:29:45,920 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:29:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-16 16:29:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-16 16:29:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-16 16:29:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-09-16 16:29:45,928 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 51 [2019-09-16 16:29:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:45,928 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-09-16 16:29:45,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:29:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-09-16 16:29:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 16:29:45,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:45,930 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:29:45,930 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 81529328, now seen corresponding path program 1 times [2019-09-16 16:29:45,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:45,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:45,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:29:45,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:29:47,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:47,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:29:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:47,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-16 16:29:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:47,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:29:47,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:47,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:47,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:47,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-09-16 16:29:47,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:47,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-16 16:29:47,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:47,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:47,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:47,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-09-16 16:29:47,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:47,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-09-16 16:29:47,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:47,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:47,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:47,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-09-16 16:29:47,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:47,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:47,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 106 [2019-09-16 16:29:47,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:47,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:47,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:47,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:47,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-16 16:29:47,605 INFO L567 ElimStorePlain]: treesize reduction 195, result has 17.0 percent of original size [2019-09-16 16:29:47,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:29:47,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-09-16 16:29:48,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-16 16:29:48,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:48,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:48,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:48,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-16 16:29:48,212 INFO L341 Elim1Store]: treesize reduction 24, result has 66.7 percent of original size [2019-09-16 16:29:48,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 75 [2019-09-16 16:29:48,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:48,246 INFO L567 ElimStorePlain]: treesize reduction 58, result has 42.0 percent of original size [2019-09-16 16:29:48,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:29:48,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:42 [2019-09-16 16:29:49,184 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2019-09-16 16:29:49,194 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 10=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|]} [2019-09-16 16:29:49,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:49,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-09-16 16:29:49,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:49,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:49,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:49,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:49,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2019-09-16 16:29:49,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:49,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:49,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:49,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:49,252 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:29:49,277 INFO L567 ElimStorePlain]: treesize reduction 30, result has 45.5 percent of original size [2019-09-16 16:29:49,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:49,278 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:14 [2019-09-16 16:29:49,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:49,628 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 29 treesize of output 21 [2019-09-16 16:29:49,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:49,642 INFO L567 ElimStorePlain]: treesize reduction 8, result has 46.7 percent of original size [2019-09-16 16:29:49,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:49,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-09-16 16:29:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-16 16:29:49,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:29:49,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 51 [2019-09-16 16:29:49,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-16 16:29:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-16 16:29:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2294, Unknown=1, NotChecked=96, Total=2550 [2019-09-16 16:29:49,708 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 51 states. [2019-09-16 16:30:00,477 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-09-16 16:30:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:06,943 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2019-09-16 16:30:06,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-16 16:30:06,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-09-16 16:30:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:06,947 INFO L225 Difference]: With dead ends: 122 [2019-09-16 16:30:06,947 INFO L226 Difference]: Without dead ends: 119 [2019-09-16 16:30:06,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=541, Invalid=6927, Unknown=18, NotChecked=170, Total=7656 [2019-09-16 16:30:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-16 16:30:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2019-09-16 16:30:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-16 16:30:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-09-16 16:30:06,968 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 52 [2019-09-16 16:30:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:06,969 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-09-16 16:30:06,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-16 16:30:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2019-09-16 16:30:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 16:30:06,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:06,970 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:06,971 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:06,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:06,971 INFO L82 PathProgramCache]: Analyzing trace with hash 556745516, now seen corresponding path program 1 times [2019-09-16 16:30:06,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:06,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:06,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-16 16:30:07,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:07,042 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:07,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:30:07,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-16 16:30:07,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:07,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-16 16:30:07,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:30:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:30:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:30:07,267 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 8 states. [2019-09-16 16:30:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:07,363 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2019-09-16 16:30:07,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:30:07,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-16 16:30:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:07,368 INFO L225 Difference]: With dead ends: 121 [2019-09-16 16:30:07,368 INFO L226 Difference]: Without dead ends: 95 [2019-09-16 16:30:07,369 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:30:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-16 16:30:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-09-16 16:30:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-16 16:30:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2019-09-16 16:30:07,402 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 53 [2019-09-16 16:30:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:07,403 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2019-09-16 16:30:07,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:30:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2019-09-16 16:30:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 16:30:07,410 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:07,411 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:07,411 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 968301521, now seen corresponding path program 2 times [2019-09-16 16:30:07,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:07,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:07,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-16 16:30:07,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:07,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:07,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:30:07,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:30:07,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:30:07,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-16 16:30:07,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:30:07,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:07,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-16 16:30:07,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:30:07,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:30:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:30:07,657 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand 8 states. [2019-09-16 16:30:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:07,764 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-09-16 16:30:07,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:30:07,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-16 16:30:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:07,766 INFO L225 Difference]: With dead ends: 134 [2019-09-16 16:30:07,766 INFO L226 Difference]: Without dead ends: 93 [2019-09-16 16:30:07,767 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:30:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-16 16:30:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-09-16 16:30:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-16 16:30:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2019-09-16 16:30:07,781 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 53 [2019-09-16 16:30:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:07,781 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-09-16 16:30:07,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:30:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2019-09-16 16:30:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 16:30:07,783 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:07,783 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:07,783 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 524255485, now seen corresponding path program 3 times [2019-09-16 16:30:07,784 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:07,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:30:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 16:30:07,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:07,837 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:07,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:30:08,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 16:30:08,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:30:08,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:30:08,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-16 16:30:08,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:08,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-16 16:30:08,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:30:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:30:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:30:08,047 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 8 states. [2019-09-16 16:30:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:08,126 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2019-09-16 16:30:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:30:08,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-16 16:30:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:08,128 INFO L225 Difference]: With dead ends: 122 [2019-09-16 16:30:08,128 INFO L226 Difference]: Without dead ends: 89 [2019-09-16 16:30:08,129 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:30:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-16 16:30:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-09-16 16:30:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-16 16:30:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-09-16 16:30:08,146 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 53 [2019-09-16 16:30:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:08,146 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-09-16 16:30:08,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:30:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-09-16 16:30:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-16 16:30:08,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:08,148 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:08,148 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1877916999, now seen corresponding path program 4 times [2019-09-16 16:30:08,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:08,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:08,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:30:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-16 16:30:08,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:08,216 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:30:08,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:30:08,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:30:08,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:30:08,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-16 16:30:08,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:30:08,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2019-09-16 16:30:08,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:30:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:30:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:30:08,398 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 10 states. [2019-09-16 16:30:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:08,494 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-09-16 16:30:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:30:08,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-09-16 16:30:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:08,496 INFO L225 Difference]: With dead ends: 112 [2019-09-16 16:30:08,496 INFO L226 Difference]: Without dead ends: 62 [2019-09-16 16:30:08,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:30:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-16 16:30:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-16 16:30:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-16 16:30:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-09-16 16:30:08,505 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 61 [2019-09-16 16:30:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:08,505 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-09-16 16:30:08,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:30:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-09-16 16:30:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 16:30:08,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:08,507 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:08,507 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2080104955, now seen corresponding path program 1 times [2019-09-16 16:30:08,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:08,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:30:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-16 16:30:08,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:08,592 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:08,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:08,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:30:08,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-16 16:30:08,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:30:08,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-09-16 16:30:08,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:30:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:30:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:30:08,740 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 7 states. [2019-09-16 16:30:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:08,835 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-09-16 16:30:08,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:30:08,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-16 16:30:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:08,839 INFO L225 Difference]: With dead ends: 72 [2019-09-16 16:30:08,839 INFO L226 Difference]: Without dead ends: 64 [2019-09-16 16:30:08,840 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:30:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-16 16:30:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-16 16:30:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-16 16:30:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-16 16:30:08,853 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 62 [2019-09-16 16:30:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:08,854 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-16 16:30:08,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:30:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-16 16:30:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 16:30:08,855 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:08,855 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:08,855 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1911919487, now seen corresponding path program 1 times [2019-09-16 16:30:08,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:08,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:08,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:30:09,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:09,977 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:10,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:10,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-16 16:30:10,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:10,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:30:10,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:10,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:10,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:10,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-09-16 16:30:10,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:10,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-16 16:30:10,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:10,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:10,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:10,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-09-16 16:30:10,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:10,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-09-16 16:30:10,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:10,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:10,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:10,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-09-16 16:30:10,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:10,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:10,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 106 [2019-09-16 16:30:10,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:30:10,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:30:10,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:10,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:30:10,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:10,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:10,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-09-16 16:30:10,410 INFO L567 ElimStorePlain]: treesize reduction 515, result has 7.0 percent of original size [2019-09-16 16:30:10,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:10,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-09-16 16:30:12,849 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2019-09-16 16:30:12,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:12,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:12,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:12,922 INFO L341 Elim1Store]: treesize reduction 24, result has 68.4 percent of original size [2019-09-16 16:30:12,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 83 [2019-09-16 16:30:12,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:12,963 INFO L567 ElimStorePlain]: treesize reduction 66, result has 41.6 percent of original size [2019-09-16 16:30:12,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:12,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2019-09-16 16:30:13,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-09-16 16:30:13,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:13,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:13,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:13,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2019-09-16 16:30:13,295 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_28|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-09-16 16:30:13,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 84 [2019-09-16 16:30:13,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:13,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:13,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:13,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:13,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 259 [2019-09-16 16:30:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:13,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:13,468 INFO L567 ElimStorePlain]: treesize reduction 212, result has 25.9 percent of original size [2019-09-16 16:30:13,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:13,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:47 [2019-09-16 16:30:14,239 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|, |#memory_int|]} [2019-09-16 16:30:14,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:14,247 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 46 treesize of output 42 [2019-09-16 16:30:14,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:14,251 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:14,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:14,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:14,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 52 [2019-09-16 16:30:14,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:14,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:14,297 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:14,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:14,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:14,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-09-16 16:30:14,333 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:14,390 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-09-16 16:30:14,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:14,393 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2019-09-16 16:30:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-09-16 16:30:14,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:14,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 53 [2019-09-16 16:30:14,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-16 16:30:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-16 16:30:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2481, Unknown=1, NotChecked=100, Total=2756 [2019-09-16 16:30:14,466 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 53 states. [2019-09-16 16:30:22,590 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-16 16:30:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:25,444 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-09-16 16:30:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-16 16:30:25,445 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 63 [2019-09-16 16:30:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:25,447 INFO L225 Difference]: With dead ends: 123 [2019-09-16 16:30:25,447 INFO L226 Difference]: Without dead ends: 111 [2019-09-16 16:30:25,450 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=580, Invalid=7253, Unknown=3, NotChecked=174, Total=8010 [2019-09-16 16:30:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-16 16:30:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-09-16 16:30:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-16 16:30:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-16 16:30:25,459 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 63 [2019-09-16 16:30:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:25,459 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-16 16:30:25,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-16 16:30:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-16 16:30:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 16:30:25,460 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:25,460 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:25,460 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1110625605, now seen corresponding path program 2 times [2019-09-16 16:30:25,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:25,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:25,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-16 16:30:25,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:25,532 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:25,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:30:25,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:30:25,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:30:25,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-16 16:30:25,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-16 16:30:25,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:25,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-16 16:30:25,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:30:25,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:30:25,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:30:25,676 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-09-16 16:30:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:25,731 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-16 16:30:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:30:25,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-16 16:30:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:25,731 INFO L225 Difference]: With dead ends: 65 [2019-09-16 16:30:25,732 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:30:25,732 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:30:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:30:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:30:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:30:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:30:25,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-09-16 16:30:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:25,734 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:30:25,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:30:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:30:25,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:30:25,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:30:26,090 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-09-16 16:30:26,280 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-16 16:30:26,589 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-16 16:30:26,855 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-16 16:30:27,065 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2019-09-16 16:30:27,221 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2019-09-16 16:30:27,459 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-16 16:30:27,463 INFO L439 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse7 (<= (+ dll_update_at_~index 1) |dll_update_at_#in~index|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (let ((.cse0 (and .cse5 .cse7 .cse6 (<= 2 |dll_update_at_#in~index|))) (.cse1 (<= |dll_update_at_#in~index| dll_update_at_~index)) (.cse3 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse2 (+ |dll_update_at_#in~head.offset| 4))) (and (or .cse0 .cse1 (and (= (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse2) dll_update_at_~head.offset) .cse3 .cse4) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (not (= (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_3) 0) 2)))) (or .cse0 (and (= |dll_update_at_#in~head.base| dll_update_at_~head.base) (<= dll_update_at_~index |dll_update_at_#in~index|) .cse5 .cse1 .cse6 .cse3 .cse4 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|)) (and (<= 1 |dll_update_at_#in~index|) (= dll_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse2)) .cse5 .cse7 .cse6))))) [2019-09-16 16:30:27,463 INFO L443 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2019-09-16 16:30:27,463 INFO L439 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-09-16 16:30:27,463 INFO L443 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2019-09-16 16:30:27,463 INFO L443 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2019-09-16 16:30:27,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:30:27,463 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:30:27,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:30:27,463 INFO L446 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2019-09-16 16:30:27,464 INFO L443 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2019-09-16 16:30:27,464 INFO L446 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2019-09-16 16:30:27,464 INFO L443 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2019-09-16 16:30:27,464 INFO L439 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-09-16 16:30:27,464 INFO L439 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse2 (= 0 dll_create_~head~0.offset)) (.cse0 (= 1 (select |#valid| dll_create_~new_head~0.base))) (.cse1 (= (select |#valid| dll_create_~head~0.base) 1)) (.cse3 (= 0 dll_create_~new_head~0.offset))) (or (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) dll_create_~head~0.base)) .cse2 .cse3) (and (<= |dll_create_#in~len| dll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) .cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 dll_create_~head~0.base)) (and .cse0 .cse1 (<= |dll_create_#in~len| (+ dll_create_~len 1)) .cse3))) [2019-09-16 16:30:27,464 INFO L443 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2019-09-16 16:30:27,464 INFO L443 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2019-09-16 16:30:27,464 INFO L446 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2019-09-16 16:30:27,464 INFO L443 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:30:27,465 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:30:27,465 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:30:27,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:30:27,466 INFO L439 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse2 (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (not (= (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) 0) 2)))) (.cse1 (or (= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= 0 dll_get_data_at_~index)))) (and (let ((.cse0 (<= (+ dll_get_data_at_~index 1) |dll_get_data_at_#in~index|))) (or (and (or (and (= (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) 4) dll_get_data_at_~head.offset) (= (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) 4) dll_get_data_at_~head.base)) (not (= 0 |dll_get_data_at_#in~head.offset|))) .cse0) (and (<= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) .cse1 (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base)) .cse2 (and (<= 2 |dll_get_data_at_#in~index|) .cse0))) (or .cse2 (<= 1 |dll_get_data_at_#in~index|) (and (<= dll_get_data_at_~index |dll_get_data_at_#in~index|) .cse1)))) [2019-09-16 16:30:27,466 INFO L443 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2019-09-16 16:30:27,466 INFO L443 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2019-09-16 16:30:27,466 INFO L446 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2019-09-16 16:30:27,466 INFO L443 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2019-09-16 16:30:27,466 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2019-09-16 16:30:27,466 INFO L443 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2019-09-16 16:30:27,466 INFO L439 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (+ main_~len~0 1)) (.cse8 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse11 (* 2 main_~len~0))) (let ((.cse4 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse0 (= main_~s~0.offset 0)) (.cse1 (<= .cse11 (+ main_~new_data~0 1))) (.cse2 (<= .cse11 (+ .cse8 1))) (.cse3 (<= main_~new_data~0 .cse10)) (.cse5 (<= .cse8 .cse10)) (.cse6 (not (= .cse9 main_~s~0.base))) (.cse7 (= main_~len~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 .cse4) .cse5 .cse6 .cse7 (= main_~i~0 0) (= main_~expected~0 .cse4)) (and (and (<= main_~expected~0 .cse8) (<= .cse8 main_~expected~0) (= main_~len~0 .cse4) .cse0 .cse1 .cse2 .cse3 .cse5 (<= 1 main_~i~0) .cse6 .cse7) (<= main_~i~0 1)))))) [2019-09-16 16:30:27,466 INFO L443 ceAbstractionStarter]: For program point L624-1(line 624) no Hoare annotation was computed. [2019-09-16 16:30:27,467 INFO L443 ceAbstractionStarter]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2019-09-16 16:30:27,467 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2019-09-16 16:30:27,467 INFO L439 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse1 (= main_~s~0.offset 0)) (.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)))) (or (and (and (<= (+ main_~i~0 main_~len~0) main_~new_data~0) (<= main_~new_data~0 (+ main_~i~0 2)) .cse0 .cse1) (= main_~len~0 2) (= main_~i~0 0)) (and .cse1 (<= (* 2 main_~len~0) (+ main_~new_data~0 1)) (and (<= 1 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) .cse0 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (<= main_~new_data~0 (+ main_~len~0 1))))) [2019-09-16 16:30:27,467 INFO L443 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2019-09-16 16:30:27,467 INFO L443 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2019-09-16 16:30:27,467 INFO L439 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~i~0) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= main_~s~0.offset 0) (= main_~len~0 2)))) (or (and .cse0 (<= 2 main_~i~0)) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse4 (* 2 main_~len~0)) (.cse1 (select (select |#memory_int| .cse3) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse2 (+ main_~len~0 1))) (and .cse0 (<= .cse1 .cse2) (not (= .cse3 main_~s~0.base)) (<= .cse4 (+ main_~new_data~0 1)) (<= .cse4 (+ .cse1 1)) (<= main_~new_data~0 .cse2)))))) [2019-09-16 16:30:27,467 INFO L446 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: true [2019-09-16 16:30:27,467 INFO L439 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-09-16 16:30:27,468 INFO L439 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse2 (<= 1 main_~i~0)) (.cse5 (not (= .cse8 main_~s~0.base))) (.cse3 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse4 (= main_~s~0.offset 0)) (.cse7 (= main_~len~0 2))) (or (let ((.cse6 (* 2 main_~len~0)) (.cse0 (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse1 (+ main_~len~0 1))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ main_~new_data~0 1)) (<= .cse6 (+ .cse0 1)) (<= main_~new_data~0 .cse1) .cse7)) (and .cse5 .cse4 .cse7 (= main_~i~0 0)) (and .cse2 (<= main_~i~0 1) .cse5 .cse3 .cse4 .cse7)))) [2019-09-16 16:30:27,468 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-09-16 16:30:27,468 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-09-16 16:30:27,468 INFO L443 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2019-09-16 16:30:27,468 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-09-16 16:30:27,468 INFO L439 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2019-09-16 16:30:27,468 INFO L443 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2019-09-16 16:30:27,468 INFO L446 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2019-09-16 16:30:27,469 INFO L446 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2019-09-16 16:30:27,469 INFO L443 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2019-09-16 16:30:27,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,480 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,482 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,490 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,490 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,498 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,499 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,499 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,499 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,500 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,500 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,500 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,501 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,501 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,501 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,501 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,502 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,502 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,502 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,536 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:30:27 BoogieIcfgContainer [2019-09-16 16:30:27,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:30:27,544 INFO L168 Benchmark]: Toolchain (without parser) took 45393.44 ms. Allocated memory was 132.6 MB in the beginning and 474.0 MB in the end (delta: 341.3 MB). Free memory was 86.4 MB in the beginning and 235.7 MB in the end (delta: -149.3 MB). Peak memory consumption was 321.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:30:27,544 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:30:27,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.59 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 86.2 MB in the beginning and 161.1 MB in the end (delta: -74.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:30:27,546 INFO L168 Benchmark]: Boogie Preprocessor took 107.65 ms. Allocated memory is still 199.8 MB. Free memory was 161.1 MB in the beginning and 157.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:30:27,546 INFO L168 Benchmark]: RCFGBuilder took 686.35 ms. Allocated memory is still 199.8 MB. Free memory was 157.7 MB in the beginning and 109.3 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:30:27,547 INFO L168 Benchmark]: TraceAbstraction took 44007.92 ms. Allocated memory was 199.8 MB in the beginning and 474.0 MB in the end (delta: 274.2 MB). Free memory was 109.3 MB in the beginning and 235.7 MB in the end (delta: -126.4 MB). Peak memory consumption was 276.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:30:27,550 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 587.59 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 86.2 MB in the beginning and 161.1 MB in the end (delta: -74.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.65 ms. Allocated memory is still 199.8 MB. Free memory was 161.1 MB in the beginning and 157.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 686.35 ms. Allocated memory is still 199.8 MB. Free memory was 157.7 MB in the beginning and 109.3 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44007.92 ms. Allocated memory was 199.8 MB in the beginning and 474.0 MB in the end (delta: 274.2 MB). Free memory was 109.3 MB in the beginning and 235.7 MB in the end (delta: -126.4 MB). Peak memory consumption was 276.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant [2019-09-16 16:30:27,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1 && 1 <= i) && len == unknown-#memory_int-unknown[s][s]) && s == 0) && !(#memory_$Pointer$[s][4] == s)) && 2 * len <= new_data + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && new_data <= len + 1) && len == 2) || (((!(#memory_$Pointer$[s][4] == s) && s == 0) && len == 2) && i == 0)) || (((((1 <= i && i <= 1) && !(#memory_$Pointer$[s][4] == s)) && len == unknown-#memory_int-unknown[s][s]) && s == 0) && len == 2) - InvariantResult [Line: 607]: Loop Invariant [2019-09-16 16:30:27,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,576 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,576 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,576 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,576 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,576 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,584 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,584 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,584 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,584 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,585 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,586 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || \old(index) <= index) || ((#memory_$Pointer$[head][head + 4] == head && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(\old(unknown-#memory_int-unknown)[v_main_~s~0.base_BEFORE_CALL_3][0] == 2))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) || ((((1 <= \old(index) && head == \old(#memory_$Pointer$)[head][head + 4]) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) - InvariantResult [Line: 600]: Loop Invariant [2019-09-16 16:30:27,590 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,591 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,593 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-09-16 16:30:27,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((#memory_$Pointer$[head][4] == head && #memory_$Pointer$[head][4] == head) || !(0 == head)) && index + 1 <= \old(index)) || (((\old(index) <= index && head == head) && (\old(index) == index || 0 == index)) && head == head)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0] == 2))) || (2 <= \old(index) && index + 1 <= \old(index))) && (((forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0] == 2)) || 1 <= \old(index)) || (index <= \old(index) && (\old(index) == index || 0 == index))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2019-09-16 16:30:27,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,599 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((1 == \valid[new_head] && \valid[head] == 1) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(#memory_$Pointer$[head][4] == head)) && 0 == head) && 0 == new_head) || (((((\old(len) <= len && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head)) || (((1 == \valid[new_head] && \valid[head] == 1) && \old(len) <= len + 1) && 0 == new_head) - InvariantResult [Line: 622]: Loop Invariant [2019-09-16 16:30:27,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,602 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-16 16:30:27,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-16 16:30:27,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:30:27,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-16 16:30:27,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((0 <= i && len == unknown-#memory_int-unknown[s][s]) && s == 0) && len == 2) && 2 <= i) || ((((((((0 <= i && len == unknown-#memory_int-unknown[s][s]) && s == 0) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && !(#memory_$Pointer$[s][4] == s)) && 2 * len <= new_data + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && new_data <= len + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 64 locations, 1 error locations. SAFE Result, 43.8s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 29.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 607 SDtfs, 576 SDslu, 2794 SDs, 0 SdLazy, 4671 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 550 SyntacticMatches, 5 SemanticMatches, 250 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3965 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 144 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 78 PreInvPairs, 107 NumberOfFragments, 799 HoareAnnotationTreeSize, 78 FomulaSimplifications, 3971 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 2661 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1259 ConstructedInterpolants, 42 QuantifiedInterpolants, 350197 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 373/490 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...