/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:39:55,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:39:55,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:39:55,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:39:55,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:39:55,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:39:55,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:39:55,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:39:55,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:39:55,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:39:55,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:39:55,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:39:55,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:39:55,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:39:55,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:39:55,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:39:55,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:39:55,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:39:55,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:39:55,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:39:55,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:39:55,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:39:55,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:39:55,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:39:55,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:39:55,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:39:55,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:39:55,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:39:55,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:39:55,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:39:55,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:39:55,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:39:55,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:39:55,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:39:55,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:39:55,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:39:55,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:39:55,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:39:55,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:39:55,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:39:55,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:39:55,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:39:55,689 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:39:55,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:39:55,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:39:55,691 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:39:55,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:39:55,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:39:55,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:39:55,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:39:55,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:39:55,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:39:55,693 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:39:55,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:39:55,693 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:39:55,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:39:55,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:39:55,694 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:39:55,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:39:55,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:39:55,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:39:55,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:39:55,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:39:55,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:39:55,695 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:39:56,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:39:56,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:39:56,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:39:56,103 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:39:56,106 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:39:56,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2020-10-23 20:39:56,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ae55e5a/1778fdb006f44799b81fee8845f26f62/FLAGd03bf0380 [2020-10-23 20:39:56,848 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:39:56,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2020-10-23 20:39:56,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ae55e5a/1778fdb006f44799b81fee8845f26f62/FLAGd03bf0380 [2020-10-23 20:39:57,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ae55e5a/1778fdb006f44799b81fee8845f26f62 [2020-10-23 20:39:57,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:39:57,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:39:57,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:39:57,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:39:57,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:39:57,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1e6964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57, skipping insertion in model container [2020-10-23 20:39:57,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:39:57,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:39:57,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:39:57,628 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:39:57,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:39:57,845 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:39:57,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57 WrapperNode [2020-10-23 20:39:57,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:39:57,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:39:57,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:39:57,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:39:57,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (1/1) ... [2020-10-23 20:39:57,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:39:57,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:39:57,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:39:57,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:39:57,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (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 [2020-10-23 20:39:58,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:39:58,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:39:58,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:39:58,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-23 20:39:58,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-23 20:39:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-10-23 20:39:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-10-23 20:39:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-10-23 20:39:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-10-23 20:39:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2020-10-23 20:39:58,079 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2020-10-23 20:39:58,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:39:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:39:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:39:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-23 20:39:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-23 20:39:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:39:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:39:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-23 20:39:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-23 20:39:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-23 20:39:58,082 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-23 20:39:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-23 20:39:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-23 20:39:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-23 20:39:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-23 20:39:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-23 20:39:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-23 20:39:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-23 20:39:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-23 20:39:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-23 20:39:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-23 20:39:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-23 20:39:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-23 20:39:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-23 20:39:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-23 20:39:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-23 20:39:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-23 20:39:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-23 20:39:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-23 20:39:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-23 20:39:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-23 20:39:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-23 20:39:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-23 20:39:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-23 20:39:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-23 20:39:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-23 20:39:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-23 20:39:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-23 20:39:58,092 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-23 20:39:58,093 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-23 20:39:58,093 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-23 20:39:58,093 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-23 20:39:58,093 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-23 20:39:58,093 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-23 20:39:58,093 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-23 20:39:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-23 20:39:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-23 20:39:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-23 20:39:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-23 20:39:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-23 20:39:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-23 20:39:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-23 20:39:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-23 20:39:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-23 20:39:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-23 20:39:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-23 20:39:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-23 20:39:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-23 20:39:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-23 20:39:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-23 20:39:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-23 20:39:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-23 20:39:58,098 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-23 20:39:58,098 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-23 20:39:58,099 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-23 20:39:58,099 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-23 20:39:58,099 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-23 20:39:58,099 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-23 20:39:58,099 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-23 20:39:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-23 20:39:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-23 20:39:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-23 20:39:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-23 20:39:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-23 20:39:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-23 20:39:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-23 20:39:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-23 20:39:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-23 20:39:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-23 20:39:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-23 20:39:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-23 20:39:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-23 20:39:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-23 20:39:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-23 20:39:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-10-23 20:39:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-10-23 20:39:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-23 20:39:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-23 20:39:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:39:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:39:58,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:39:58,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:39:58,590 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-10-23 20:39:58,874 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:39:58,874 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-23 20:39:58,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:39:58 BoogieIcfgContainer [2020-10-23 20:39:58,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:39:58,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:39:58,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:39:58,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:39:58,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:39:57" (1/3) ... [2020-10-23 20:39:58,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dc4e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:39:58, skipping insertion in model container [2020-10-23 20:39:58,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:39:57" (2/3) ... [2020-10-23 20:39:58,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dc4e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:39:58, skipping insertion in model container [2020-10-23 20:39:58,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:39:58" (3/3) ... [2020-10-23 20:39:58,898 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2020-10-23 20:39:58,913 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:39:58,919 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:39:58,936 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:39:58,965 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:39:58,965 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:39:58,966 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:39:58,966 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:39:58,966 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:39:58,966 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:39:58,966 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:39:58,966 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:39:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2020-10-23 20:39:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-23 20:39:59,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:39:59,002 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:39:59,002 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:39:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:39:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash 442902572, now seen corresponding path program 1 times [2020-10-23 20:39:59,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:39:59,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271191052] [2020-10-23 20:39:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:39:59,116 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:39:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:39:59,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:39:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:39:59,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:39:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:39:59,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 20:39:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:39:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:39:59,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271191052] [2020-10-23 20:39:59,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:39:59,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:39:59,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469813026] [2020-10-23 20:39:59,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:39:59,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:39:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:39:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:39:59,374 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2020-10-23 20:39:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:39:59,905 INFO L93 Difference]: Finished difference Result 240 states and 300 transitions. [2020-10-23 20:39:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-23 20:39:59,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-10-23 20:39:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:39:59,920 INFO L225 Difference]: With dead ends: 240 [2020-10-23 20:39:59,920 INFO L226 Difference]: Without dead ends: 132 [2020-10-23 20:39:59,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:39:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-23 20:39:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2020-10-23 20:39:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-23 20:39:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2020-10-23 20:39:59,986 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 44 [2020-10-23 20:39:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:39:59,987 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2020-10-23 20:39:59,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:39:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2020-10-23 20:39:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-23 20:39:59,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:39:59,990 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:39:59,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:39:59,990 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:39:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:39:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 826822239, now seen corresponding path program 1 times [2020-10-23 20:39:59,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:39:59,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831496345] [2020-10-23 20:39:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:39:59,997 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:00,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:00,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:00,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 20:40:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:40:00,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831496345] [2020-10-23 20:40:00,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:00,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:40:00,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99265339] [2020-10-23 20:40:00,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:40:00,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:40:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:40:00,194 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 7 states. [2020-10-23 20:40:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:40:00,697 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2020-10-23 20:40:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:40:00,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-10-23 20:40:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:40:00,700 INFO L225 Difference]: With dead ends: 153 [2020-10-23 20:40:00,700 INFO L226 Difference]: Without dead ends: 98 [2020-10-23 20:40:00,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:40:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-23 20:40:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2020-10-23 20:40:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-23 20:40:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2020-10-23 20:40:00,721 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 44 [2020-10-23 20:40:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:40:00,722 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2020-10-23 20:40:00,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:40:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2020-10-23 20:40:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-23 20:40:00,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:40:00,724 INFO L422 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, 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] [2020-10-23 20:40:00,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:40:00,725 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:40:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:40:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1922711407, now seen corresponding path program 1 times [2020-10-23 20:40:00,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:40:00,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141948011] [2020-10-23 20:40:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:40:01,418 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:01,480 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_21|, |v_#memory_$Pointer$.offset_21|], 4=[|v_#memory_int_22|]} [2020-10-23 20:40:01,494 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:01,657 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:01,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:01,671 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:01,804 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:40:01,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:01,824 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:01,953 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:01,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:01,959 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:01,959 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:02,103 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:02,121 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:02,127 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:02,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:02,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:02,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:40:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:02,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-10-23 20:40:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:40:02,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141948011] [2020-10-23 20:40:02,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:02,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:40:02,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449957628] [2020-10-23 20:40:02,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:40:02,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:40:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:40:02,456 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 9 states. [2020-10-23 20:40:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:40:03,066 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2020-10-23 20:40:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:40:03,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-10-23 20:40:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:40:03,069 INFO L225 Difference]: With dead ends: 162 [2020-10-23 20:40:03,070 INFO L226 Difference]: Without dead ends: 107 [2020-10-23 20:40:03,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:40:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-23 20:40:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2020-10-23 20:40:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-23 20:40:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2020-10-23 20:40:03,113 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 62 [2020-10-23 20:40:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:40:03,115 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2020-10-23 20:40:03,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:40:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2020-10-23 20:40:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-23 20:40:03,121 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:40:03,121 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:40:03,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:40:03,121 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:40:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:40:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 118606403, now seen corresponding path program 2 times [2020-10-23 20:40:03,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:40:03,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227468769] [2020-10-23 20:40:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:40:03,818 WARN L193 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:03,845 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_25|], 4=[|v_#memory_int_26|]} [2020-10-23 20:40:03,864 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:04,068 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:04,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:04,080 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:04,254 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:04,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:04,265 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:04,417 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:04,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:04,421 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:04,422 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:04,544 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:05,167 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:05,191 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:05,394 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:40:05,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:05,404 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:05,574 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:05,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:05,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:05,576 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:05,722 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:06,286 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:06,309 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:06,479 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:06,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:06,493 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:06,655 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:06,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:06,657 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:06,658 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:06,796 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:07,338 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:07,351 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_37|], 4=[|v_#memory_int_38|]} [2020-10-23 20:40:07,357 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:07,495 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:07,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:07,506 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:07,621 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:07,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:07,628 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:07,743 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:07,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:07,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:07,747 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:08,313 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:08,325 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 4=[|v_#memory_int_42|]} [2020-10-23 20:40:08,335 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:08,457 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:08,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:08,466 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:08,602 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:08,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:08,609 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:08,736 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:08,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:08,739 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:08,739 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:08,865 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:09,406 WARN L193 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:09,420 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_45|], 4=[|v_#memory_int_46|]} [2020-10-23 20:40:09,434 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:09,570 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:09,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:09,576 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:09,689 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:09,690 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:09,695 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:09,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:09,795 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:09,796 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:09,903 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:10,501 WARN L193 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:10,517 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:10,638 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:10,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:10,646 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:10,759 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:10,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:10,761 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:10,762 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:40:10,887 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:11,560 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:11,567 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_53|], 4=[|v_#memory_int_54|]} [2020-10-23 20:40:11,574 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:11,743 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:11,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:11,752 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:11,871 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:11,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:11,879 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:11,997 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:11,998 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:12,000 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:12,000 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:12,116 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:12,119 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:12,124 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:12,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:12,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:12,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:40:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:12,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:40:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:12,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-23 20:40:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-23 20:40:12,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227468769] [2020-10-23 20:40:12,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:12,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:40:12,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928458037] [2020-10-23 20:40:12,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:40:12,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:40:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:40:12,390 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 6 states. [2020-10-23 20:40:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:40:12,835 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-10-23 20:40:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:40:12,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2020-10-23 20:40:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:40:12,839 INFO L225 Difference]: With dead ends: 144 [2020-10-23 20:40:12,839 INFO L226 Difference]: Without dead ends: 115 [2020-10-23 20:40:12,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:40:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-23 20:40:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2020-10-23 20:40:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-23 20:40:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2020-10-23 20:40:12,867 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 80 [2020-10-23 20:40:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:40:12,869 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2020-10-23 20:40:12,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:40:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2020-10-23 20:40:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 20:40:12,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:40:12,876 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-23 20:40:12,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:40:12,877 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:40:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:40:12,877 INFO L82 PathProgramCache]: Analyzing trace with hash 647954943, now seen corresponding path program 1 times [2020-10-23 20:40:12,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:40:12,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613423957] [2020-10-23 20:40:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:40:13,420 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:13,436 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_57|], 4=[|v_#memory_int_58|]} [2020-10-23 20:40:13,442 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:13,636 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:13,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:13,642 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:13,764 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:13,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:13,780 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:13,930 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:13,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:13,932 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:13,932 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:14,063 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:14,694 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:14,710 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:14,857 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:14,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:14,871 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:15,000 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:15,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:15,001 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:15,002 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:15,131 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:15,655 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:15,670 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:15,816 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:15,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:15,827 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:15,956 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:15,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:15,957 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:15,958 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:16,093 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:16,667 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:16,677 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_71|], 4=[|v_#memory_int_72|]} [2020-10-23 20:40:16,689 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:16,822 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:16,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:16,827 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:16,935 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:40:16,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:16,946 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:17,054 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:17,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:17,056 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:17,056 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:17,172 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:17,715 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:17,721 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_75|, |v_#memory_$Pointer$.offset_75|], 4=[|v_#memory_int_76|]} [2020-10-23 20:40:17,728 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:17,859 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:17,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:17,865 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:18,009 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:18,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:18,015 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:18,139 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:18,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:18,141 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:18,142 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:18,274 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:18,849 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:18,860 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_79|, |v_#memory_$Pointer$.base_79|], 4=[|v_#memory_int_80|]} [2020-10-23 20:40:18,867 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:19,009 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:19,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:19,016 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:19,146 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:19,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:19,154 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:19,265 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:19,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:19,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:19,267 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:19,376 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:20,000 WARN L193 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:20,017 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:20,168 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:20,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:20,175 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:20,294 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:20,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:20,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:20,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:40:20,416 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:20,900 WARN L193 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:20,910 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_87|, |v_#memory_$Pointer$.offset_87|], 4=[|v_#memory_int_88|]} [2020-10-23 20:40:20,917 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:21,037 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:21,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:21,043 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:21,154 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:21,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:21,160 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:21,272 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:21,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:21,273 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:21,273 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:21,375 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:21,383 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:40:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:40:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:40:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-23 20:40:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-23 20:40:21,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613423957] [2020-10-23 20:40:21,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:21,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:40:21,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324918032] [2020-10-23 20:40:21,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:40:21,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:40:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:40:21,669 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 9 states. [2020-10-23 20:40:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:40:22,345 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2020-10-23 20:40:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:40:22,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2020-10-23 20:40:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:40:22,349 INFO L225 Difference]: With dead ends: 172 [2020-10-23 20:40:22,349 INFO L226 Difference]: Without dead ends: 124 [2020-10-23 20:40:22,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:40:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-23 20:40:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2020-10-23 20:40:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-23 20:40:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2020-10-23 20:40:22,371 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 93 [2020-10-23 20:40:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:40:22,372 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2020-10-23 20:40:22,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:40:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2020-10-23 20:40:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-23 20:40:22,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:40:22,377 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2020-10-23 20:40:22,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:40:22,378 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:40:22,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:40:22,381 INFO L82 PathProgramCache]: Analyzing trace with hash -388218185, now seen corresponding path program 1 times [2020-10-23 20:40:22,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:40:22,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293722384] [2020-10-23 20:40:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:40:22,436 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:22,960 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:22,966 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_92|, |v_#memory_$Pointer$.offset_92|], 4=[|v_#memory_int_92|]} [2020-10-23 20:40:22,973 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:23,096 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:23,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:23,102 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:23,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:23,205 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:23,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:23,302 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:23,303 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:23,571 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:40:24,307 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:24,326 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:24,467 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:40:24,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:24,473 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:24,605 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:24,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:24,607 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:24,607 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:24,744 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:25,299 WARN L193 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:25,312 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:25,469 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:40:25,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:25,477 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:25,632 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:25,633 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:25,634 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:25,634 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:25,787 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:26,334 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:26,347 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_106|, |v_#memory_$Pointer$.base_106|], 4=[|v_#memory_int_106|]} [2020-10-23 20:40:26,366 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:26,546 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:26,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:26,553 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:26,696 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:40:26,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:26,704 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:26,843 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:26,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:26,845 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:26,845 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:26,983 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:27,496 WARN L193 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:27,509 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_110|, |v_#memory_$Pointer$.base_110|], 4=[|v_#memory_int_110|]} [2020-10-23 20:40:27,516 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:27,707 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:27,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:27,714 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:27,837 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:27,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:27,844 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:27,971 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:27,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:27,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:27,973 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:28,108 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:28,617 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:28,624 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_114|, |v_#memory_$Pointer$.offset_114|], 4=[|v_#memory_int_114|]} [2020-10-23 20:40:28,638 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:28,763 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:28,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:28,770 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:28,874 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:40:28,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:28,880 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:29,011 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:29,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:29,013 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:29,013 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:29,144 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:29,705 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:29,725 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:29,916 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:29,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:29,923 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:30,060 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:30,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:30,062 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:30,062 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:40:30,183 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:30,745 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:30,754 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_122|, |v_#memory_$Pointer$.base_122|], 4=[|v_#memory_int_122|]} [2020-10-23 20:40:30,760 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:30,928 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:30,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:30,933 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:31,068 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:31,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:31,077 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:31,190 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:31,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:31,191 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:31,192 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:31,300 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:31,302 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:31,306 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:40:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:40:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:40:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-23 20:40:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-23 20:40:31,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293722384] [2020-10-23 20:40:31,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:31,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:40:31,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597404099] [2020-10-23 20:40:31,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:40:31,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:40:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:40:31,573 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 9 states. [2020-10-23 20:40:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:40:32,180 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2020-10-23 20:40:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:40:32,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2020-10-23 20:40:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:40:32,183 INFO L225 Difference]: With dead ends: 150 [2020-10-23 20:40:32,183 INFO L226 Difference]: Without dead ends: 121 [2020-10-23 20:40:32,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:40:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-23 20:40:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2020-10-23 20:40:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-23 20:40:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2020-10-23 20:40:32,228 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 100 [2020-10-23 20:40:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:40:32,229 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2020-10-23 20:40:32,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:40:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2020-10-23 20:40:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 20:40:32,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:40:32,231 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2020-10-23 20:40:32,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:40:32,232 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:40:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:40:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1276569099, now seen corresponding path program 2 times [2020-10-23 20:40:32,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:40:32,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823718108] [2020-10-23 20:40:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:40:32,283 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:32,900 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:32,905 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_127|, |v_#memory_$Pointer$.base_127|], 4=[|v_#memory_int_126|]} [2020-10-23 20:40:32,921 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:33,084 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:33,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:33,091 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:33,206 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:33,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:33,212 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:33,315 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:33,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:33,317 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:33,318 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:33,426 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:33,927 WARN L193 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:33,941 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:34,094 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:34,095 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:34,104 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:34,244 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:34,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:34,245 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:34,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:34,386 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:34,968 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:34,979 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:35,118 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:35,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:35,125 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:35,268 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:35,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:35,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:35,270 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:35,417 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:35,956 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:35,962 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_139|], 4=[|v_#memory_int_138|]} [2020-10-23 20:40:35,968 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:36,128 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:36,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:36,133 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:36,263 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:36,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:36,269 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:36,399 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:36,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:36,401 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:36,401 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:36,518 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:37,143 WARN L193 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:37,149 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_143|, |v_#memory_$Pointer$.base_143|], 4=[|v_#memory_int_142|]} [2020-10-23 20:40:37,155 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:37,280 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:37,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:37,286 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:37,423 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:37,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:37,429 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:37,534 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:37,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:37,537 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:37,537 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:37,642 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:38,352 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:38,360 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_151|, |v_#memory_$Pointer$.offset_151|], 4=[|v_#memory_int_150|]} [2020-10-23 20:40:38,371 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:38,514 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:38,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:38,525 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:38,668 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:38,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:38,674 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:38,785 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:38,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:38,787 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:38,787 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:38,892 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:39,185 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:40:39,838 WARN L193 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:39,852 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_159|], 4=[|v_#memory_int_158|]} [2020-10-23 20:40:39,858 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:39,997 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:39,998 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:40,010 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:40,131 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:40,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:40,138 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:40,248 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:40,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:40,250 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:40,250 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:40,355 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:40,958 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:40,989 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:41,151 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-23 20:40:41,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:41,159 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:41,295 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:41,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:41,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:41,297 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:40:41,430 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:41,717 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:40:41,780 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:41,782 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:40:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:40:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:40:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:40:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:41,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 20:40:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-23 20:40:42,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823718108] [2020-10-23 20:40:42,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:42,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:40:42,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983927034] [2020-10-23 20:40:42,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:40:42,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:40:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:40:42,054 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 9 states. [2020-10-23 20:40:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:40:42,697 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2020-10-23 20:40:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:40:42,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2020-10-23 20:40:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:40:42,699 INFO L225 Difference]: With dead ends: 160 [2020-10-23 20:40:42,700 INFO L226 Difference]: Without dead ends: 132 [2020-10-23 20:40:42,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:40:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-23 20:40:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-10-23 20:40:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-23 20:40:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2020-10-23 20:40:42,748 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 113 [2020-10-23 20:40:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:40:42,749 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2020-10-23 20:40:42,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:40:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2020-10-23 20:40:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-10-23 20:40:42,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:40:42,751 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1] [2020-10-23 20:40:42,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:40:42,752 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:40:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:40:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash -816086307, now seen corresponding path program 1 times [2020-10-23 20:40:42,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:40:42,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395512733] [2020-10-23 20:40:42,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:40:42,801 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:43,384 WARN L193 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:43,397 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_172|, |v_#memory_$Pointer$.offset_172|], 4=[|v_#memory_int_170|]} [2020-10-23 20:40:43,402 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:43,546 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:43,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:43,561 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:43,703 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:43,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:43,710 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:43,831 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:43,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:43,832 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:43,832 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:43,952 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:44,580 WARN L193 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:44,601 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:44,755 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:40:44,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:44,763 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:44,917 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:44,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:44,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:44,919 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:45,072 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:45,728 WARN L193 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:45,740 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:45,918 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:40:45,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:45,927 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:46,121 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:46,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:46,122 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:46,122 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:40:46,312 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:46,842 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:46,852 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_184|, |v_#memory_$Pointer$.offset_184|], 4=[|v_#memory_int_182|]} [2020-10-23 20:40:46,860 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:46,988 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:46,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:46,993 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:47,123 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:47,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:47,129 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:47,249 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:47,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:47,251 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:47,251 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:47,371 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:40:48,013 WARN L193 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:48,025 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_188|, |v_#memory_$Pointer$.base_188|], 4=[|v_#memory_int_186|]} [2020-10-23 20:40:48,030 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:48,183 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:48,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:48,191 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:48,319 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:48,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:48,326 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:48,438 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:48,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:48,440 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:48,440 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:48,568 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:49,353 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:49,364 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_196|, |v_#memory_$Pointer$.offset_196|], 4=[|v_#memory_int_194|]} [2020-10-23 20:40:49,370 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:49,543 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:40:49,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:49,550 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:49,695 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:40:49,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:49,702 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:49,828 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:49,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:49,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:49,830 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:40:49,975 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:40:50,300 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:40:50,933 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:40:50,942 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.base_205|], 4=[|v_#memory_int_202|]} [2020-10-23 20:40:50,948 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:51,085 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:51,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:51,092 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:51,222 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:40:51,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:51,228 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:51,357 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:51,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:51,359 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:51,359 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:40:51,491 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:40:52,139 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:40:52,157 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:52,363 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:40:52,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:52,371 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:52,549 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:52,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:40:52,550 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:40:52,550 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:40:52,701 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:40:53,004 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:40:53,065 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:40:53,069 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:40:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:53,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:40:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:53,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:40:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:53,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:40:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:54,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:40:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:54,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:40:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:54,848 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2020-10-23 20:40:54,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:40:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:55,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 20:40:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:40:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-23 20:40:55,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395512733] [2020-10-23 20:40:55,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:40:55,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2020-10-23 20:40:55,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861612094] [2020-10-23 20:40:55,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-10-23 20:40:55,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:40:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-10-23 20:40:55,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1550, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:40:55,760 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 41 states. [2020-10-23 20:40:58,107 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2020-10-23 20:40:58,314 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-10-23 20:40:58,820 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-10-23 20:40:59,110 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-10-23 20:40:59,303 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-10-23 20:41:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:41:03,286 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2020-10-23 20:41:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-10-23 20:41:03,287 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 120 [2020-10-23 20:41:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:41:03,290 INFO L225 Difference]: With dead ends: 218 [2020-10-23 20:41:03,290 INFO L226 Difference]: Without dead ends: 213 [2020-10-23 20:41:03,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=411, Invalid=5751, Unknown=0, NotChecked=0, Total=6162 [2020-10-23 20:41:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-10-23 20:41:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 158. [2020-10-23 20:41:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-23 20:41:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2020-10-23 20:41:03,348 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 120 [2020-10-23 20:41:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:41:03,350 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2020-10-23 20:41:03,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-10-23 20:41:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2020-10-23 20:41:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-10-23 20:41:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:41:03,354 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2020-10-23 20:41:03,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:41:03,355 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:41:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:41:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1168520651, now seen corresponding path program 2 times [2020-10-23 20:41:03,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:41:03,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427882576] [2020-10-23 20:41:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:41:03,399 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:03,876 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:03,887 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_218|, |v_#memory_$Pointer$.base_218|], 4=[|v_#memory_int_214|]} [2020-10-23 20:41:03,893 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:04,059 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:04,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:04,065 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:04,209 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:04,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:04,225 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:04,443 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:04,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:04,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:04,445 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:04,608 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:05,223 WARN L193 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:05,239 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:05,394 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:05,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:05,402 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:05,558 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:05,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:05,559 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:05,559 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:05,719 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:06,415 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:06,425 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:06,571 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:41:06,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:06,580 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:06,720 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:06,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:06,721 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:06,721 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:06,879 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:07,505 WARN L193 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:07,521 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_233|, |v_#memory_$Pointer$.offset_233|], 4=[|v_#memory_int_226|]} [2020-10-23 20:41:07,529 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:07,671 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:07,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:07,679 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:07,809 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:07,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:07,815 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:07,930 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:07,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:07,931 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:07,931 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:08,044 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:08,702 WARN L193 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:08,706 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_237|, |v_#memory_$Pointer$.base_237|], 4=[|v_#memory_int_230|]} [2020-10-23 20:41:08,712 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:08,884 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:08,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:08,901 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:09,056 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:09,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:09,062 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:09,191 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:09,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:09,193 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:09,193 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:09,321 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:10,157 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:10,168 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_248|, |v_#memory_$Pointer$.base_248|], 4=[|v_#memory_int_238|]} [2020-10-23 20:41:10,183 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:10,356 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:10,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:10,366 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:10,520 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:10,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:10,527 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:10,647 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:10,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:10,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:10,648 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:10,787 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:11,093 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:11,774 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:11,780 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_257|, |v_#memory_$Pointer$.offset_257|], 4=[|v_#memory_int_246|]} [2020-10-23 20:41:11,785 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:11,914 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:11,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:11,920 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:12,047 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:12,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:12,052 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:12,164 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:12,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:12,165 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:12,166 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:12,301 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:12,862 WARN L193 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:12,873 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:13,006 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-23 20:41:13,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:13,019 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:13,185 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:13,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:13,186 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:13,186 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:41:13,354 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:13,641 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:13,697 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:13,700 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:41:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:41:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:41:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:41:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:41:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:41:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:41:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 20:41:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-23 20:41:13,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427882576] [2020-10-23 20:41:13,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:41:13,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:41:13,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499216431] [2020-10-23 20:41:13,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:41:13,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:41:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:41:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:41:13,955 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 11 states. [2020-10-23 20:41:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:41:14,952 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2020-10-23 20:41:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:41:14,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2020-10-23 20:41:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:41:14,955 INFO L225 Difference]: With dead ends: 211 [2020-10-23 20:41:14,955 INFO L226 Difference]: Without dead ends: 165 [2020-10-23 20:41:14,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:41:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-23 20:41:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2020-10-23 20:41:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-23 20:41:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2020-10-23 20:41:14,984 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 127 [2020-10-23 20:41:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:41:14,984 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2020-10-23 20:41:14,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:41:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2020-10-23 20:41:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-10-23 20:41:14,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:41:14,987 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2020-10-23 20:41:14,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:41:14,987 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:41:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:41:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1552067517, now seen corresponding path program 3 times [2020-10-23 20:41:14,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:41:14,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614337953] [2020-10-23 20:41:14,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:41:15,175 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2020-10-23 20:41:15,261 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:15,764 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:15,779 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_272|, |v_#memory_$Pointer$.offset_272|], 4=[|v_#memory_int_260|]} [2020-10-23 20:41:15,784 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:15,916 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:15,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:15,922 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:16,031 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:41:16,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:16,036 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:16,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:16,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:16,134 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:16,241 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:16,827 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:16,839 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:17,012 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-23 20:41:17,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:17,019 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:17,162 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:17,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:17,163 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:17,164 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:17,304 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:17,823 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:17,852 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:18,029 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-23 20:41:18,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:18,041 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:18,182 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:18,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:18,183 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:18,184 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:18,323 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:18,905 WARN L193 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:18,914 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_284|, |v_#memory_$Pointer$.offset_284|], 4=[|v_#memory_int_272|]} [2020-10-23 20:41:18,919 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:19,054 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:19,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:19,060 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:19,179 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:41:19,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:19,184 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:19,288 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:19,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:19,290 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:19,290 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:19,876 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:19,880 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_288|, |v_#memory_$Pointer$.offset_288|], 4=[|v_#memory_int_276|]} [2020-10-23 20:41:19,893 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:20,040 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:20,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:20,046 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:20,169 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:20,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:20,175 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:20,292 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:20,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:20,293 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:20,293 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:20,412 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:20,603 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:20,842 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:21,402 WARN L193 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:21,406 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_296|, |v_#memory_$Pointer$.base_296|], 4=[|v_#memory_int_284|]} [2020-10-23 20:41:21,411 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:21,563 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:21,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:21,570 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:21,711 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:21,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:21,716 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:21,854 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:21,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:21,856 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:21,856 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:22,008 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:22,222 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:22,917 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:22,921 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_303|, |v_#memory_$Pointer$.base_303|], 4=[|v_#memory_int_290|]} [2020-10-23 20:41:22,927 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:23,058 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:23,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:23,064 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:23,193 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:23,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:23,199 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:23,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:23,294 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:23,295 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:23,906 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:23,924 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:24,061 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:24,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:24,068 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:24,210 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:24,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:24,211 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:24,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:41:24,344 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:24,523 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:24,765 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:24,823 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:24,826 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:41:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:24,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:41:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:24,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:41:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:24,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:41:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:24,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:41:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:24,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:41:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:25,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:41:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:25,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 20:41:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-23 20:41:25,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614337953] [2020-10-23 20:41:25,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:41:25,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:41:25,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470962063] [2020-10-23 20:41:25,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:41:25,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:41:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:41:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:41:25,070 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 11 states. [2020-10-23 20:41:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:41:26,031 INFO L93 Difference]: Finished difference Result 238 states and 264 transitions. [2020-10-23 20:41:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:41:26,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2020-10-23 20:41:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:41:26,035 INFO L225 Difference]: With dead ends: 238 [2020-10-23 20:41:26,035 INFO L226 Difference]: Without dead ends: 160 [2020-10-23 20:41:26,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:41:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-23 20:41:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2020-10-23 20:41:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-23 20:41:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2020-10-23 20:41:26,063 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 127 [2020-10-23 20:41:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:41:26,063 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2020-10-23 20:41:26,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:41:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2020-10-23 20:41:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-10-23 20:41:26,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:41:26,066 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2020-10-23 20:41:26,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:41:26,066 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:41:26,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:41:26,066 INFO L82 PathProgramCache]: Analyzing trace with hash -418148571, now seen corresponding path program 4 times [2020-10-23 20:41:26,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:41:26,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1871361843] [2020-10-23 20:41:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:41:26,303 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:26,304 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:26,304 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:26,305 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:26,305 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:26,306 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:26,877 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:26,881 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_322|, |v_#memory_$Pointer$.offset_322|], 4=[|v_#memory_int_302|]} [2020-10-23 20:41:26,886 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:27,015 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:27,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:27,021 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:27,133 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:41:27,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:27,143 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:27,245 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:27,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:27,246 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:27,246 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:27,354 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:27,916 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:27,930 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:28,093 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-23 20:41:28,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:28,101 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:28,247 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:28,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:28,248 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:28,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:28,385 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:28,908 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:28,934 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:29,213 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-23 20:41:29,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:29,220 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:29,444 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:29,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:29,446 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:29,446 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:29,613 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:30,150 WARN L193 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:30,155 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_334|, |v_#memory_$Pointer$.offset_334|], 4=[|v_#memory_int_314|]} [2020-10-23 20:41:30,160 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:30,277 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:30,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:30,283 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:30,455 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:30,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:30,466 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:30,599 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:30,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:30,601 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:30,601 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:30,719 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:31,253 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:31,262 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_338|, |v_#memory_$Pointer$.base_338|], 4=[|v_#memory_int_318|]} [2020-10-23 20:41:31,269 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:31,437 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:31,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:31,442 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:31,580 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:31,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:31,588 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:31,716 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:31,716 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:31,717 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:31,717 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:31,838 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:32,601 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:32,604 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_346|, |v_#memory_$Pointer$.base_346|], 4=[|v_#memory_int_326|]} [2020-10-23 20:41:32,610 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:32,772 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:32,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:32,778 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:32,906 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:32,906 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:32,912 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:33,037 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:33,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:33,038 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:33,039 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:33,166 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:33,547 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-23 20:41:34,178 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:34,186 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_355|, |v_#memory_$Pointer$.offset_355|], 4=[|v_#memory_int_334|]} [2020-10-23 20:41:34,196 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:34,345 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:34,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:34,352 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:34,514 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:34,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:34,520 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:34,648 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:34,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:34,650 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:34,650 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:34,782 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:35,416 WARN L193 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:35,430 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:35,578 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:35,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:35,584 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:35,702 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:35,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:35,703 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:35,704 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:41:35,842 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:36,208 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-23 20:41:36,273 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:36,276 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:41:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:41:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:41:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:41:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:41:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:41:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-23 20:41:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 20:41:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-23 20:41:36,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1871361843] [2020-10-23 20:41:36,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:41:36,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:41:36,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555314096] [2020-10-23 20:41:36,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:41:36,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:41:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:41:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:41:36,520 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 11 states. [2020-10-23 20:41:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:41:37,684 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2020-10-23 20:41:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:41:37,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2020-10-23 20:41:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:41:37,687 INFO L225 Difference]: With dead ends: 224 [2020-10-23 20:41:37,687 INFO L226 Difference]: Without dead ends: 132 [2020-10-23 20:41:37,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:41:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-23 20:41:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2020-10-23 20:41:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-23 20:41:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2020-10-23 20:41:37,709 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 127 [2020-10-23 20:41:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:41:37,710 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2020-10-23 20:41:37,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:41:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2020-10-23 20:41:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-23 20:41:37,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:41:37,712 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2020-10-23 20:41:37,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:41:37,712 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:41:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:41:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash 235482206, now seen corresponding path program 1 times [2020-10-23 20:41:37,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:41:37,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776430965] [2020-10-23 20:41:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:41:37,790 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:38,335 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:38,342 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_369|], 4=[|v_#memory_int_346|]} [2020-10-23 20:41:38,348 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:38,489 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:38,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:38,495 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:38,627 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:38,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:38,633 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:38,748 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:38,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:38,750 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:38,750 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:38,877 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:39,448 WARN L193 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:39,459 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:39,621 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:41:39,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:39,633 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:39,781 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:39,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:39,783 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:39,783 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:39,934 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:40,104 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-23 20:41:40,665 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:40,674 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:40,824 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:41:40,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:40,830 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:40,958 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:40,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:40,959 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:40,959 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:41,083 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:41,682 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:41,692 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_382|, |v_#memory_$Pointer$.offset_382|], 4=[|v_#memory_int_359|]} [2020-10-23 20:41:41,698 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:41,825 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:41,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:41,831 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:41,963 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:41:41,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:41,969 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:42,099 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:42,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:42,101 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:42,101 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:42,220 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:42,750 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:42,755 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_386|, |v_#memory_$Pointer$.base_386|], 4=[|v_#memory_int_363|]} [2020-10-23 20:41:42,760 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:42,910 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:42,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:42,916 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:43,047 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:43,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:43,052 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:43,175 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:43,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:43,176 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:43,177 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:43,298 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:44,073 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:44,077 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_394|, |v_#memory_$Pointer$.offset_394|], 4=[|v_#memory_int_371|]} [2020-10-23 20:41:44,086 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:44,250 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:44,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:44,258 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:44,395 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:44,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:44,401 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:44,528 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:44,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:44,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:44,529 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:44,654 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:44,953 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:45,292 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-23 20:41:45,952 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:45,960 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_403|, |v_#memory_$Pointer$.base_403|], 4=[|v_#memory_int_382|]} [2020-10-23 20:41:45,967 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:46,091 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:46,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:46,097 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:46,216 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:41:46,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:46,222 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:46,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:46,323 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:46,324 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:46,431 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:46,984 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:46,995 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:47,147 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:47,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:47,154 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:47,276 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:47,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:47,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:47,277 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:41:47,406 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:47,690 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:47,755 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:47,758 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:41:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:41:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:41:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:41:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:41:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:41:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:41:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 20:41:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-23 20:41:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:41:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-23 20:41:48,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776430965] [2020-10-23 20:41:48,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:41:48,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:41:48,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259787719] [2020-10-23 20:41:48,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:41:48,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:41:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:41:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:41:48,429 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 23 states. [2020-10-23 20:41:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:41:51,521 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2020-10-23 20:41:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-23 20:41:51,522 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2020-10-23 20:41:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:41:51,525 INFO L225 Difference]: With dead ends: 173 [2020-10-23 20:41:51,525 INFO L226 Difference]: Without dead ends: 160 [2020-10-23 20:41:51,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2020-10-23 20:41:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-23 20:41:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2020-10-23 20:41:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-10-23 20:41:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2020-10-23 20:41:51,552 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 137 [2020-10-23 20:41:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:41:51,553 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2020-10-23 20:41:51,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:41:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2020-10-23 20:41:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-23 20:41:51,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:41:51,555 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:41:51,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:41:51,555 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:41:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:41:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1720710870, now seen corresponding path program 2 times [2020-10-23 20:41:51,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:41:51,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [635769754] [2020-10-23 20:41:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:41:51,736 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-10-23 20:41:51,847 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:41:52,520 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:52,523 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_418|, |v_#memory_$Pointer$.offset_418|], 4=[|v_#memory_int_395|]} [2020-10-23 20:41:52,529 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:52,666 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:52,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:52,671 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:52,809 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:41:52,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:52,815 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:52,937 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:52,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:52,938 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:52,939 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:53,060 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:41:53,643 WARN L193 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:53,652 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:53,823 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-23 20:41:53,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:53,829 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:53,965 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:53,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:53,966 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:53,966 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:54,107 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:54,271 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-23 20:41:54,888 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:41:54,897 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:55,064 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:41:55,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:55,071 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:55,217 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:55,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:55,218 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:55,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:41:55,355 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:55,819 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:55,828 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_431|, |v_#memory_$Pointer$.offset_431|], 4=[|v_#memory_int_408|]} [2020-10-23 20:41:55,834 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:56,050 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:41:56,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:56,058 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:56,225 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:41:56,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:56,231 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:56,355 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:56,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:56,357 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:56,357 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:41:56,481 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:41:57,002 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:57,005 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_435|, |v_#memory_$Pointer$.base_435|], 4=[|v_#memory_int_412|]} [2020-10-23 20:41:57,012 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:57,187 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:57,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:57,195 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:57,356 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:57,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:57,363 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:57,492 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:57,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:57,494 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:57,494 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:57,621 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:58,412 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:41:58,419 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_443|, |v_#memory_$Pointer$.offset_443|], 4=[|v_#memory_int_420|]} [2020-10-23 20:41:58,426 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:58,594 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:41:58,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:58,600 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:58,760 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:41:58,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:58,767 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:58,907 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:58,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:41:58,908 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:41:58,909 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:41:59,050 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:41:59,344 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:41:59,569 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2020-10-23 20:41:59,783 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-23 20:42:00,002 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2020-10-23 20:42:00,714 WARN L193 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:42:00,718 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_454|, |v_#memory_$Pointer$.offset_454|], 4=[|v_#memory_int_431|]} [2020-10-23 20:42:00,723 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:00,869 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:42:00,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:00,875 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:01,015 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:42:01,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:01,022 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:01,147 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:42:01,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:01,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:01,148 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:42:01,264 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:42:01,952 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:42:01,963 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:02,131 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:02,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:02,138 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:02,297 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:42:02,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:02,298 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:02,299 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:42:02,455 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:42:02,777 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:42:02,835 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:42:02,839 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:42:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:02,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:42:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:02,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:42:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:02,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:42:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:03,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:42:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:03,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:42:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:03,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:42:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:03,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 20:42:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:03,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-23 20:42:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-23 20:42:03,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [635769754] [2020-10-23 20:42:03,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:42:03,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:42:03,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794532663] [2020-10-23 20:42:03,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:42:03,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:42:03,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:42:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:42:03,105 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 11 states. [2020-10-23 20:42:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:42:03,986 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2020-10-23 20:42:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:42:03,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-10-23 20:42:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:42:03,990 INFO L225 Difference]: With dead ends: 195 [2020-10-23 20:42:03,990 INFO L226 Difference]: Without dead ends: 137 [2020-10-23 20:42:03,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:42:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-23 20:42:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-23 20:42:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-23 20:42:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2020-10-23 20:42:04,010 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 144 [2020-10-23 20:42:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:42:04,010 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2020-10-23 20:42:04,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:42:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2020-10-23 20:42:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-23 20:42:04,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:42:04,012 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:42:04,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:42:04,013 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:42:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:42:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1161456387, now seen corresponding path program 3 times [2020-10-23 20:42:04,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:42:04,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1495612246] [2020-10-23 20:42:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:42:04,098 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:42:04,723 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:42:04,731 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_468|, |v_#memory_$Pointer$.base_468|], 4=[|v_#memory_int_443|]} [2020-10-23 20:42:04,748 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:04,902 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:04,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:04,909 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:05,025 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:42:05,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:05,031 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:05,148 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:42:05,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:05,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:05,150 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:42:05,270 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:42:05,998 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:42:06,017 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:06,226 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:42:06,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:06,233 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:06,396 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:06,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:06,397 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:06,397 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:42:06,560 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:06,733 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-23 20:42:07,537 WARN L193 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:42:07,549 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:07,751 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-23 20:42:07,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:07,758 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:07,915 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:07,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:07,916 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:07,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:188 [2020-10-23 20:42:08,084 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:08,653 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:42:08,657 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_481|, |v_#memory_$Pointer$.offset_481|], 4=[|v_#memory_int_458|]} [2020-10-23 20:42:08,664 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:08,822 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:42:08,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:08,830 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:08,994 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-23 20:42:08,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:09,003 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:09,134 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:42:09,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:09,136 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:09,136 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:42:09,270 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 20:42:09,929 WARN L193 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:42:09,933 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_485|, |v_#memory_$Pointer$.base_485|], 4=[|v_#memory_int_462|]} [2020-10-23 20:42:09,941 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:10,114 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:42:10,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:10,121 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:10,260 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:10,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:10,267 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:10,397 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:42:10,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:10,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:10,398 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:42:10,526 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:42:11,460 WARN L193 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:42:11,463 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_493|, |v_#memory_$Pointer$.offset_493|], 4=[|v_#memory_int_470|]} [2020-10-23 20:42:11,470 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:11,645 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-23 20:42:11,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:11,653 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:11,822 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:11,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:11,829 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:11,972 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:42:11,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:11,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:11,973 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:192 [2020-10-23 20:42:12,191 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-23 20:42:12,534 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:42:12,891 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-10-23 20:42:13,769 WARN L193 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2020-10-23 20:42:13,773 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_502|, |v_#memory_$Pointer$.base_502|], 4=[|v_#memory_int_482|]} [2020-10-23 20:42:13,780 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:13,952 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-23 20:42:13,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:13,960 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:14,121 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:42:14,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:14,142 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:14,287 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:42:14,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:14,288 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:14,288 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:189 [2020-10-23 20:42:14,427 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 20:42:15,184 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2020-10-23 20:42:15,196 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:15,374 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-23 20:42:15,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:15,380 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:15,522 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:42:15,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 20:42:15,523 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 20:42:15,523 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:182 [2020-10-23 20:42:15,684 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-23 20:42:16,105 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2020-10-23 20:42:16,282 INFO L120 Accelerator]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2020-10-23 20:42:16,285 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:42:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:42:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:42:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 20:42:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 20:42:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-10-23 20:42:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-23 20:42:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 20:42:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-23 20:42:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-23 20:42:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:42:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-23 20:42:16,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1495612246] [2020-10-23 20:42:16,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:42:16,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:42:16,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056644266] [2020-10-23 20:42:16,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:42:16,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:42:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:42:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:42:16,541 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 11 states. [2020-10-23 20:42:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:42:17,219 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2020-10-23 20:42:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:42:17,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2020-10-23 20:42:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:42:17,221 INFO L225 Difference]: With dead ends: 162 [2020-10-23 20:42:17,221 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:42:17,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:42:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:42:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:42:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:42:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:42:17,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2020-10-23 20:42:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:42:17,224 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:42:17,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:42:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:42:17,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:42:17,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:42:17,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:42:18,846 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2020-10-23 20:42:19,124 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2020-10-23 20:42:19,278 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-23 20:42:19,423 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-10-23 20:42:19,580 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-10-23 20:42:19,736 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-10-23 20:42:19,980 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-10-23 20:42:20,385 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-10-23 20:42:20,528 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2020-10-23 20:42:20,801 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-10-23 20:42:20,966 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2020-10-23 20:42:21,379 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-10-23 20:42:21,769 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2020-10-23 20:42:22,108 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2020-10-23 20:42:22,569 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-10-23 20:42:22,768 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-10-23 20:42:22,983 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-10-23 20:42:23,198 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-10-23 20:42:23,445 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-10-23 20:42:23,627 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-10-23 20:42:23,993 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2020-10-23 20:42:24,207 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-10-23 20:42:24,422 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-10-23 20:42:24,619 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2020-10-23 20:42:24,926 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2020-10-23 20:42:25,231 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2020-10-23 20:42:25,525 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2020-10-23 20:42:25,925 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2020-10-23 20:42:26,106 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2020-10-23 20:42:26,255 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-10-23 20:42:26,432 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2020-10-23 20:42:26,751 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2020-10-23 20:42:26,972 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 30 [2020-10-23 20:42:27,189 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2020-10-23 20:42:27,627 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2020-10-23 20:42:27,790 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2020-10-23 20:42:28,009 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-10-23 20:42:28,687 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-10-23 20:42:28,693 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,693 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,694 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,694 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,694 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,694 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,694 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,694 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |old(#t~string1.offset)| |#t~string1.offset|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point myexitENTRY(lines 571 573) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L572(line 572) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L274 CegarLoopResult]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L595(line 595) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L594(line 594) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L595-1(line 595) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L594-1(line 594) the Hoare annotation is: true [2020-10-23 20:42:28,695 INFO L277 CegarLoopResult]: At program point L594-2(line 594) the Hoare annotation is: true [2020-10-23 20:42:28,696 INFO L277 CegarLoopResult]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2020-10-23 20:42:28,696 INFO L277 CegarLoopResult]: At program point L593-3(lines 592 598) the Hoare annotation is: true [2020-10-23 20:42:28,696 INFO L277 CegarLoopResult]: At program point sll_destroyEXIT(lines 592 598) the Hoare annotation is: true [2020-10-23 20:42:28,696 INFO L270 CegarLoopResult]: At program point sll_destroyENTRY(lines 592 598) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-10-23 20:42:28,696 INFO L270 CegarLoopResult]: At program point L609(line 609) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 (= |sll_update_at_#in~index| sll_update_at_~index) (<= 1 |sll_update_at_#in~index|) .cse2 (let ((.cse3 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse3 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse3 sll_update_at_~head.base))))) (and .cse0 .cse1 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse2 (<= 2 |sll_update_at_#in~index|)))) [2020-10-23 20:42:28,696 INFO L270 CegarLoopResult]: At program point L608(line 608) the Hoare annotation is: (and (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|))) (or (and .cse0 .cse1 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)) (and .cse0 (= |sll_update_at_#in~head.base| sll_update_at_~head.base) .cse1 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|)))) (<= 1 |sll_update_at_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,696 INFO L270 CegarLoopResult]: At program point L609-1(line 609) the Hoare annotation is: (and (<= 1 |sll_update_at_#in~index|) (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (<= |sll_update_at_#t~post13| |sll_update_at_#in~index|)) (.cse2 (= |#memory_int| |old(#memory_int)|))) (or (and .cse0 .cse1 .cse2 (= |sll_update_at_#in~index| sll_update_at_~index) (let ((.cse3 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse3 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse3 sll_update_at_~head.base))))) (and .cse0 .cse1 .cse2 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,697 INFO L270 CegarLoopResult]: At program point L608-1(line 608) the Hoare annotation is: (and (let ((.cse0 (= |#memory_int| |old(#memory_int)|))) (or (and (or (and (= |sll_update_at_#t~mem12.base| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4)) (= |sll_update_at_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4))) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|)) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) .cse0 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|)) (and .cse0 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 1 |sll_update_at_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,697 INFO L270 CegarLoopResult]: At program point L609-2(line 609) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (<= |sll_update_at_#t~post13| |sll_update_at_#in~index|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse4 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 |sll_update_at_#in~index|)) (and .cse0 .cse1 .cse2 (<= 1 |sll_update_at_#in~index|) .cse3 .cse4 (let ((.cse5 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse5 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse5 sll_update_at_~head.base))))))) [2020-10-23 20:42:28,697 INFO L270 CegarLoopResult]: At program point L606(lines 606 612) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |#memory_int| |old(#memory_int)|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,698 INFO L270 CegarLoopResult]: At program point L608-2(line 608) the Hoare annotation is: (and (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|))) (or (and .cse0 .cse1 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (.cse4 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4)) (.cse2 (<= (+ |sll_update_at_#in~head.offset| 1) 0)) (.cse3 (<= 1 |sll_update_at_#in~head.offset|))) (and .cse0 (or .cse2 .cse3 (and (= sll_update_at_~data |sll_update_at_#in~data|) (= |sll_update_at_#t~mem12.base| .cse4) (= |sll_update_at_#t~mem12.offset| .cse5))) .cse1 (= |sll_update_at_#in~index| sll_update_at_~index) (or (= .cse4 |sll_update_at_#in~head.base|) (and (= sll_update_at_~head.offset .cse5) (= .cse4 sll_update_at_~head.base)) .cse2 .cse3))))) (<= 1 |sll_update_at_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,698 INFO L270 CegarLoopResult]: At program point L606-1(lines 606 612) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |#memory_int| |old(#memory_int)|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,698 INFO L270 CegarLoopResult]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse5 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 (<= 1 |sll_update_at_#in~index|) .cse2 .cse3 (let ((.cse4 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse4 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) .cse5 (= .cse4 sll_update_at_~head.base))))) (and .cse0 (= |sll_update_at_#in~head.base| sll_update_at_~head.base) .cse1 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |sll_update_at_#in~index|)))) [2020-10-23 20:42:28,698 INFO L270 CegarLoopResult]: At program point L607-3(lines 607 610) the Hoare annotation is: (let ((.cse5 (= sll_update_at_~data |sll_update_at_#in~data|))) (and (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse3 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 (<= |sll_update_at_#in~index| 0) .cse2) (and .cse0 .cse1 .cse3 .cse2 (let ((.cse4 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse4 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) .cse5 (= .cse4 sll_update_at_~head.base))))) (and .cse0 .cse1 .cse3 .cse2 (<= 2 |sll_update_at_#in~index|)))) (or (<= 1 |sll_update_at_#in~index|) (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) .cse5)))) [2020-10-23 20:42:28,699 INFO L270 CegarLoopResult]: At program point sll_update_atFINAL(lines 606 612) the Hoare annotation is: (let ((.cse2 (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|)) (.cse3 (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|))) (let ((.cse4 (select .cse3 4)) (.cse6 (select .cse2 4)) (.cse5 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4))) (and (let ((.cse0 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|))) (or (and .cse0 (<= 2 |sll_update_at_#in~index|)) (<= |sll_update_at_#in~index| 0) (and (or (<= (+ |sll_update_at_#in~head.offset| 1) 0) (let ((.cse1 (= |sll_update_at_#in~head.base| .cse6))) (and (or .cse1 (= .cse2 .cse3)) (or .cse1 (= (select (select |#memory_int| .cse4) .cse5) |sll_update_at_#in~data|)))) (<= 1 |sll_update_at_#in~head.offset|)) .cse0))) (or (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (or (= |sll_update_at_#in~head.offset| 4) (let ((.cse7 (@diff |old(#memory_int)| |#memory_int|))) (and (= .cse4 .cse6) (or (= |#memory_int| |old(#memory_int)|) (= .cse7 |sll_update_at_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) 4) .cse5) (= (store |old(#memory_int)| .cse7 (select |#memory_int| .cse7)) |#memory_int|)))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|)) (<= 1 |sll_update_at_#in~index|))))) [2020-10-23 20:42:28,699 INFO L270 CegarLoopResult]: At program point sll_update_atEXIT(lines 606 612) the Hoare annotation is: (let ((.cse2 (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|)) (.cse3 (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|))) (let ((.cse4 (select .cse3 4)) (.cse6 (select .cse2 4)) (.cse5 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4))) (and (let ((.cse0 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|))) (or (and .cse0 (<= 2 |sll_update_at_#in~index|)) (<= |sll_update_at_#in~index| 0) (and (or (<= (+ |sll_update_at_#in~head.offset| 1) 0) (let ((.cse1 (= |sll_update_at_#in~head.base| .cse6))) (and (or .cse1 (= .cse2 .cse3)) (or .cse1 (= (select (select |#memory_int| .cse4) .cse5) |sll_update_at_#in~data|)))) (<= 1 |sll_update_at_#in~head.offset|)) .cse0))) (or (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (or (= |sll_update_at_#in~head.offset| 4) (let ((.cse7 (@diff |old(#memory_int)| |#memory_int|))) (and (= .cse4 .cse6) (or (= |#memory_int| |old(#memory_int)|) (= .cse7 |sll_update_at_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) 4) .cse5) (= (store |old(#memory_int)| .cse7 (select |#memory_int| .cse7)) |#memory_int|)))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|)) (<= 1 |sll_update_at_#in~index|))))) [2020-10-23 20:42:28,699 INFO L270 CegarLoopResult]: At program point sll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,699 INFO L274 CegarLoopResult]: For program point __bswap_32ENTRY(lines 74 78) no Hoare annotation was computed. [2020-10-23 20:42:28,699 INFO L274 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-10-23 20:42:28,699 INFO L274 CegarLoopResult]: For program point L77-1(line 77) no Hoare annotation was computed. [2020-10-23 20:42:28,699 INFO L274 CegarLoopResult]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2020-10-23 20:42:28,699 INFO L274 CegarLoopResult]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2020-10-23 20:42:28,699 INFO L270 CegarLoopResult]: At program point sll_createEXIT(lines 583 591) the Hoare annotation is: (or (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) (= (select |#valid| sll_create_~head~0.base) 1) (= sll_create_~head~0.offset 0) (= |sll_create_#res.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4) |sll_create_#res.base|))) (and (<= |sll_create_#in~len| 1) (<= |sll_create_#in~len| (+ sll_create_~len 1)))) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point sll_createENTRY(lines 583 591) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base)))) (or (and .cse0 (= |sll_create_#in~len| sll_create_~len)) (and .cse0 (= sll_create_~new_head~0.offset 0) (not (= sll_create_~head~0.base sll_create_~new_head~0.base))))) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L586(line 586) the Hoare annotation is: (or (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (= (select |#valid| sll_create_~head~0.base) 1)) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|))) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L587-1(line 587) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base)))) (or (and .cse0 (= |sll_create_#in~len| sll_create_~len)) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (= sll_create_~new_head~0.offset 0) (not (= sll_create_~head~0.base sll_create_~new_head~0.base))))) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L586-1(line 586) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |sll_create_#t~ret7.base|) 1))) (or (and .cse0 (= |sll_create_#t~ret7.offset| 0) (not (= sll_create_~head~0.base |sll_create_#t~ret7.base|))) (and .cse0 (= |sll_create_#in~len| sll_create_~len)))) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L584(line 584) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L586-2(line 586) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |sll_create_#t~ret7.base|) 1)) (.cse1 (= 1 (select |#valid| sll_create_~new_head~0.base)))) (or (and .cse0 .cse1 (= |sll_create_#t~ret7.offset| 0) (= sll_create_~new_head~0.offset 0) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base |sll_create_#t~ret7.base|))) (and .cse0 .cse1 (= |sll_create_#in~len| sll_create_~len)))) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L583(lines 583 591) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,700 INFO L270 CegarLoopResult]: At program point L585-2(lines 585 589) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 (= |sll_create_#in~len| sll_create_~len) .cse1) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)))) [2020-10-23 20:42:28,701 INFO L270 CegarLoopResult]: At program point L585-3(line 585) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)) (and .cse0 (<= |sll_create_#in~len| |sll_create_#t~post6|) (= |sll_create_#in~len| sll_create_~len) .cse1))) [2020-10-23 20:42:28,701 INFO L270 CegarLoopResult]: At program point L585-4(line 585) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)) (and .cse0 (<= |sll_create_#in~len| |sll_create_#t~post6|) .cse1 (<= |sll_create_#in~len| (+ sll_create_~len 1))))) [2020-10-23 20:42:28,701 INFO L270 CegarLoopResult]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 .cse1 (<= |sll_create_#in~len| (+ sll_create_~len 1))) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)))) [2020-10-23 20:42:28,701 INFO L270 CegarLoopResult]: At program point L585-6(lines 585 589) the Hoare annotation is: (or (and (<= |sll_create_#in~len| 1) (<= |sll_create_#in~len| (+ sll_create_~len 1))) (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) (= (select |#valid| sll_create_~head~0.base) 1) (= sll_create_~head~0.offset 0))) [2020-10-23 20:42:28,701 INFO L270 CegarLoopResult]: At program point sll_createFINAL(lines 583 591) the Hoare annotation is: (or (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) (= (select |#valid| sll_create_~head~0.base) 1) (= sll_create_~head~0.offset 0) (= |sll_create_#res.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4) |sll_create_#res.base|))) (and (<= |sll_create_#in~len| 1) (<= |sll_create_#in~len| (+ sll_create_~len 1)))) [2020-10-23 20:42:28,701 INFO L274 CegarLoopResult]: For program point __bswap_64ENTRY(lines 79 83) no Hoare annotation was computed. [2020-10-23 20:42:28,701 INFO L274 CegarLoopResult]: For program point L82-1(line 82) no Hoare annotation was computed. [2020-10-23 20:42:28,701 INFO L274 CegarLoopResult]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2020-10-23 20:42:28,701 INFO L274 CegarLoopResult]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2020-10-23 20:42:28,701 INFO L274 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-10-23 20:42:28,701 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:42:28,701 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:42:28,702 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:42:28,702 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:42:28,702 INFO L277 CegarLoopResult]: At program point sll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2020-10-23 20:42:28,702 INFO L270 CegarLoopResult]: At program point L604(line 604) the Hoare annotation is: (let ((.cse0 (<= 1 |sll_get_data_at_#in~index|))) (and (or (and (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#t~mem11|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse0) (let ((.cse1 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse1 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse3 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse2 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse5 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and (or .cse2 (= (select (select |#memory_int| .cse3) .cse4) |sll_get_data_at_#t~mem11|) .cse5) .cse1 (or (and (= sll_get_data_at_~head.offset .cse4) (= sll_get_data_at_~head.base .cse3)) .cse2 .cse5) .cse0)) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))))) [2020-10-23 20:42:28,702 INFO L270 CegarLoopResult]: At program point L604-1(line 604) the Hoare annotation is: (let ((.cse6 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse5 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse4 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4))) (let ((.cse2 (select (select |#memory_int| .cse5) .cse4)) (.cse1 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse3 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and (or .cse1 (= .cse2 |sll_get_data_at_#t~mem11|) .cse3) .cse0 (or .cse1 (= .cse2 |sll_get_data_at_#res|) .cse3) (or (and (= sll_get_data_at_~head.offset .cse4) (= sll_get_data_at_~head.base .cse5)) .cse1 .cse3) .cse6))) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (let ((.cse7 (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|))) (and (= .cse7 |sll_get_data_at_#t~mem11|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= .cse7 |sll_get_data_at_#res|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) .cse6))) [2020-10-23 20:42:28,702 INFO L270 CegarLoopResult]: At program point L602(line 602) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 |sll_get_data_at_#in~index|))) [2020-10-23 20:42:28,702 INFO L270 CegarLoopResult]: At program point L601(line 601) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= 1 |sll_get_data_at_#in~index|))) [2020-10-23 20:42:28,702 INFO L270 CegarLoopResult]: At program point L602-1(line 602) the Hoare annotation is: (let ((.cse0 (<= |sll_get_data_at_#t~post10| |sll_get_data_at_#in~index|))) (or (and .cse0 (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 |sll_get_data_at_#in~index|)) (and .cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)))) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point sll_get_data_atFINAL(lines 599 605) the Hoare annotation is: (let ((.cse5 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse2 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse1 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse4 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and .cse0 (or .cse1 (= (select (select |#memory_int| .cse2) .cse3) |sll_get_data_at_#res|) .cse4) (or (and (= sll_get_data_at_~head.offset .cse3) (= sll_get_data_at_~head.base .cse2)) .cse1 .cse4) .cse5)) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse5))) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point L601-1(line 601) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (and (or (<= 1 |sll_get_data_at_#in~head.offset|) (and (= |sll_get_data_at_#t~mem9.base| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (= |sll_get_data_at_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4))) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= 1 |sll_get_data_at_#in~index|))) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point L602-2(line 602) the Hoare annotation is: (let ((.cse0 (<= |sll_get_data_at_#t~post10| |sll_get_data_at_#in~index|)) (.cse1 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 .cse1 (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 |sll_get_data_at_#in~index|)) (and .cse0 .cse1 (<= 2 |sll_get_data_at_#in~index|)))) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point L599(lines 599 605) the Hoare annotation is: (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point L601-2(line 601) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse2 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse1 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse0 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse3 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and (or .cse0 (and (= |sll_get_data_at_#t~mem9.base| .cse1) (= |sll_get_data_at_#t~mem9.offset| .cse2)) .cse3) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (or (and (= sll_get_data_at_~head.offset .cse2) (= sll_get_data_at_~head.base .cse1)) .cse0 .cse3) (<= 1 |sll_get_data_at_#in~index|)))) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (and .cse0 (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 |sll_get_data_at_#in~index|)) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)))) [2020-10-23 20:42:28,703 INFO L270 CegarLoopResult]: At program point L600-3(lines 600 603) the Hoare annotation is: (let ((.cse1 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (and .cse0 (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) .cse1) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse1))) [2020-10-23 20:42:28,704 INFO L270 CegarLoopResult]: At program point sll_get_data_atEXIT(lines 599 605) the Hoare annotation is: (let ((.cse5 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse2 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse1 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse4 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and .cse0 (or .cse1 (= (select (select |#memory_int| .cse2) .cse3) |sll_get_data_at_#res|) .cse4) (or (and (= sll_get_data_at_~head.offset .cse3) (= sll_get_data_at_~head.base .cse2)) .cse1 .cse4) .cse5)) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse5))) [2020-10-23 20:42:28,704 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 613 632) the Hoare annotation is: true [2020-10-23 20:42:28,704 INFO L270 CegarLoopResult]: At program point L630(line 630) the Hoare annotation is: false [2020-10-23 20:42:28,704 INFO L270 CegarLoopResult]: At program point L622-2(lines 622 627) the Hoare annotation is: (let ((.cse6 (* 2 main_~len~0)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= main_~len~0 .cse5)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (<= 0 main_~i~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 1) (+ main_~i~0 main_~len~0)) (<= main_~i~0 1)) (and .cse0 .cse1 (<= main_~i~0 0) .cse2 .cse3 .cse4 (<= (+ .cse5 2) .cse6))))) [2020-10-23 20:42:28,704 INFO L270 CegarLoopResult]: At program point L622-3(line 622) the Hoare annotation is: (let ((.cse6 (* 2 main_~len~0)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= main_~len~0 .cse5)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (<= 0 main_~i~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse6))) (or (and .cse0 .cse1 (<= main_~i~0 0) .cse2 .cse3 .cse4 (<= |main_#t~post16| 0) (<= (+ .cse5 2) .cse6)) (let ((.cse7 (+ .cse5 1))) (and .cse0 .cse1 (<= .cse7 (+ main_~len~0 |main_#t~post16|)) (<= |main_#t~post16| 1) .cse2 .cse3 .cse4 (<= .cse7 (+ main_~i~0 main_~len~0)) (<= main_~i~0 1)))))) [2020-10-23 20:42:28,704 INFO L270 CegarLoopResult]: At program point L618(line 618) the Hoare annotation is: (and (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)) (= main_~s~0.offset 0)) [2020-10-23 20:42:28,704 INFO L270 CegarLoopResult]: At program point L622-4(line 622) the Hoare annotation is: (let ((.cse4 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (<= (+ main_~new_data~0 2) .cse4)) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (<= (+ .cse1 1) (+ main_~len~0 |main_#t~post16|)) (<= |main_#t~post16| 1) (<= (+ main_~i~0 2) .cse1) .cse2 .cse3 (<= 0 main_~i~0)) (and .cse0 (<= main_~len~0 .cse1) .cse2 (<= (+ main_~i~0 1) 0) .cse3 (<= |main_#t~post16| 0) (<= (+ .cse1 2) .cse4))))) [2020-10-23 20:42:28,705 INFO L270 CegarLoopResult]: At program point L622-5(lines 622 627) the Hoare annotation is: (let ((.cse9 (* 2 main_~len~0)) (.cse8 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (<= main_~len~0 .cse8)) (.cse0 (= main_~len~0 2)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (<= (+ main_~new_data~0 2) .cse9)) (.cse4 (<= (+ .cse8 2) .cse9))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~i~0 1) 0) .cse3 .cse4) (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse6 (+ main_~i~0 main_~len~0)) (.cse7 (select (select |#memory_int| .cse5) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 .cse1 (not (= .cse5 main_~s~0.base)) .cse2 .cse3 (<= .cse6 .cse7) (<= (+ .cse8 1) .cse6) (<= (+ .cse7 1) .cse9) (= main_~s~0.offset 0)))) (and .cse0 (<= (+ main_~i~0 2) .cse8) .cse2 .cse3 (<= 0 main_~i~0) .cse4)))) [2020-10-23 20:42:28,705 INFO L277 CegarLoopResult]: At program point L622-6(lines 622 627) the Hoare annotation is: true [2020-10-23 20:42:28,705 INFO L270 CegarLoopResult]: At program point L618-3(line 618) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse8 (+ .cse5 1)) (.cse4 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= (+ |main_#t~post15| 1) main_~len~0)) (.cse2 (not (= .cse10 main_~s~0.base))) (.cse6 (<= .cse8 .cse4)) (.cse7 (= main_~s~0.offset 0))) (or (let ((.cse3 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) (<= main_~len~0 (+ main_~i~0 1)) (<= (+ main_~i~0 main_~len~0) .cse5) (<= .cse4 .cse3) (<= 1 |main_#t~post15|) .cse6 .cse7)) (let ((.cse9 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 (<= .cse4 .cse8) .cse1 .cse2 (<= (+ main_~i~0 2) .cse9) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse4) (<= 0 main_~i~0) .cse6 (<= (+ .cse9 2) .cse4) .cse7))))))) [2020-10-23 20:42:28,705 INFO L270 CegarLoopResult]: At program point L618-4(line 618) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse6 (* 2 main_~len~0)) (.cse10 (+ (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse6 .cse10)) (.cse2 (<= (+ |main_#t~post15| 1) main_~len~0)) (.cse3 (not (= .cse11 main_~s~0.base))) (.cse4 (<= (+ main_~i~0 2) main_~len~0)) (.cse7 (<= .cse10 .cse6)) (.cse8 (= main_~s~0.offset 0))) (or (let ((.cse5 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) (<= 0 main_~i~0) (<= .cse6 .cse5) (<= 1 |main_#t~post15|) .cse7 .cse8)) (let ((.cse9 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 .cse9) .cse2 .cse3 .cse4 (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse6) .cse7 (<= (+ .cse9 2) .cse6) .cse8)))))) [2020-10-23 20:42:28,706 INFO L270 CegarLoopResult]: At program point L618-5(lines 618 621) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse6 (* 2 main_~len~0)) (.cse10 (+ (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (let ((.cse3 (= main_~len~0 2)) (.cse4 (<= .cse6 .cse10)) (.cse0 (not (= .cse11 main_~s~0.base))) (.cse7 (<= (+ main_~i~0 2) main_~len~0)) (.cse8 (<= .cse10 .cse6)) (.cse2 (= main_~s~0.offset 0))) (or (let ((.cse1 (+ main_~i~0 1))) (and .cse0 (<= .cse1 main_~len~0) (<= 1 main_~i~0) (<= main_~len~0 .cse1) .cse2 (<= main_~i~0 1))) (let ((.cse5 (+ main_~new_data~0 1))) (and .cse3 .cse4 .cse0 (<= .cse5 .cse6) .cse7 (<= 0 main_~i~0) (<= .cse6 .cse5) .cse8 .cse2)) (let ((.cse9 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse3 .cse4 (<= main_~len~0 .cse9) .cse0 .cse7 (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse6) .cse8 (<= (+ .cse9 2) .cse6) .cse2)))))) [2020-10-23 20:42:28,706 INFO L270 CegarLoopResult]: At program point L618-6(lines 618 621) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse1 (+ (select (select |#memory_int| .cse3) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse0 (* 2 main_~len~0))) (and (= main_~len~0 2) (<= .cse0 .cse1) (<= main_~len~0 .cse2) (not (= .cse3 main_~s~0.base)) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= (+ main_~i~0 1) 0) (<= .cse1 .cse0) (<= (+ .cse2 2) .cse0) (= main_~s~0.offset 0)))) [2020-10-23 20:42:28,706 INFO L270 CegarLoopResult]: At program point L631(line 631) the Hoare annotation is: false [2020-10-23 20:42:28,706 INFO L270 CegarLoopResult]: At program point L623(line 623) the Hoare annotation is: (let ((.cse7 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse7)) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (+ main_~i~0 main_~len~0)) (.cse6 (select (select |#memory_int| .cse2) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 (<= main_~len~0 .cse1) (not (= .cse2 main_~s~0.base)) .cse3 .cse4 (<= .cse5 .cse6) (<= (+ .cse1 1) .cse5) (<= (+ .cse6 1) .cse7) (= main_~s~0.offset 0)))) (and .cse0 (<= (+ main_~i~0 2) .cse1) .cse3 .cse4 (<= 0 main_~i~0) (<= (+ .cse1 2) .cse7))))) [2020-10-23 20:42:28,706 INFO L270 CegarLoopResult]: At program point L619(line 619) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse0 (not (= .cse5 main_~s~0.base))) (.cse2 (= main_~s~0.offset 0))) (or (let ((.cse1 (+ main_~i~0 1))) (and .cse0 (<= .cse1 main_~len~0) (<= 1 main_~i~0) (<= main_~len~0 .cse1) .cse2 (<= main_~i~0 1))) (let ((.cse4 (+ (select (select |#memory_int| .cse5) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1)) (.cse3 (* 2 main_~len~0))) (and (<= .cse3 .cse4) (= main_~len~0 2) .cse0 (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= .cse4 .cse3) .cse2))))) [2020-10-23 20:42:28,707 INFO L270 CegarLoopResult]: At program point L615(line 615) the Hoare annotation is: (and (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,707 INFO L277 CegarLoopResult]: At program point L628(line 628) the Hoare annotation is: true [2020-10-23 20:42:28,707 INFO L270 CegarLoopResult]: At program point L624(line 624) the Hoare annotation is: (let ((.cse7 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse4 (<= main_~len~0 main_~new_data~0)) (.cse5 (<= (+ main_~new_data~0 2) .cse7)) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse6 (+ main_~i~0 main_~len~0)) (.cse3 (select (select |#memory_int| .cse2) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 (<= main_~len~0 .cse1) (not (= .cse2 main_~s~0.base)) (<= .cse3 main_~expected~0) .cse4 .cse5 (<= .cse6 .cse3) (<= main_~expected~0 .cse3) (<= (+ .cse1 1) .cse6) (<= (+ .cse3 1) .cse7) (= main_~s~0.offset 0)))) (and .cse0 (<= (+ main_~i~0 2) .cse1) (<= .cse1 main_~expected~0) .cse4 .cse5 (<= 0 main_~i~0) (<= (+ .cse1 2) .cse7) (<= main_~expected~0 .cse1))))) [2020-10-23 20:42:28,707 INFO L270 CegarLoopResult]: At program point L624-1(line 624) the Hoare annotation is: (let ((.cse7 (* 2 main_~len~0))) (let ((.cse8 (= main_~len~0 2)) (.cse1 (<= main_~len~0 main_~new_data~0)) (.cse2 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse10 (<= 0 main_~i~0)) (.cse3 (<= (+ main_~new_data~0 2) .cse7)) (.cse6 (<= main_~expected~0 |main_#t~ret17|)) (.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (let ((.cse9 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse4 (+ main_~i~0 main_~len~0))) (and (<= main_~len~0 .cse0) .cse1 .cse2 .cse3 (<= .cse4 .cse5) .cse6 (<= (+ .cse5 1) .cse7) .cse8 (not (= .cse9 main_~s~0.base)) (<= .cse5 main_~expected~0) .cse10 (<= main_~expected~0 .cse5) (<= (+ .cse0 1) .cse4) (= main_~s~0.offset 0)))) (and .cse8 (<= (+ main_~i~0 2) .cse0) (<= .cse0 main_~expected~0) .cse1 .cse2 .cse10 .cse3 .cse6 (<= (+ .cse0 2) .cse7) (<= main_~expected~0 .cse0))))) [2020-10-23 20:42:28,707 INFO L270 CegarLoopResult]: At program point L624-2(lines 624 626) the Hoare annotation is: (let ((.cse7 (* 2 main_~len~0))) (let ((.cse8 (= main_~len~0 2)) (.cse1 (<= main_~len~0 main_~new_data~0)) (.cse2 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse10 (<= 0 main_~i~0)) (.cse3 (<= (+ main_~new_data~0 2) .cse7)) (.cse6 (<= main_~expected~0 |main_#t~ret17|)) (.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (let ((.cse9 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse4 (+ main_~i~0 main_~len~0))) (and (<= main_~len~0 .cse0) .cse1 .cse2 .cse3 (<= .cse4 .cse5) .cse6 (<= (+ .cse5 1) .cse7) .cse8 (not (= .cse9 main_~s~0.base)) (<= .cse5 main_~expected~0) .cse10 (<= main_~expected~0 .cse5) (<= (+ .cse0 1) .cse4) (= main_~s~0.offset 0)))) (and .cse8 (<= (+ main_~i~0 2) .cse0) (<= .cse0 main_~expected~0) .cse1 .cse2 .cse10 .cse3 .cse6 (<= (+ .cse0 2) .cse7) (<= main_~expected~0 .cse0))))) [2020-10-23 20:42:28,708 INFO L270 CegarLoopResult]: At program point L624-3(line 624) the Hoare annotation is: false [2020-10-23 20:42:28,708 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 613 632) the Hoare annotation is: true [2020-10-23 20:42:28,708 INFO L270 CegarLoopResult]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse0 (not (= .cse6 main_~s~0.base))) (.cse3 (* 2 main_~len~0)) (.cse4 (= main_~s~0.offset 0))) (or (let ((.cse1 (+ main_~i~0 1)) (.cse2 (+ main_~new_data~0 1))) (and .cse0 (<= .cse1 main_~len~0) (<= .cse2 .cse3) (<= 1 main_~i~0) (<= main_~len~0 .cse1) (<= .cse3 .cse2) .cse4 (<= main_~i~0 1))) (let ((.cse5 (+ (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (and (<= .cse3 .cse5) (= main_~len~0 2) .cse0 (<= (+ main_~i~0 2) main_~len~0) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse3) (<= 0 main_~i~0) (<= .cse5 .cse3) .cse4))))) [2020-10-23 20:42:28,708 INFO L270 CegarLoopResult]: At program point L624-4(line 624) the Hoare annotation is: (let ((.cse8 (* 2 main_~len~0)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= main_~len~0 .cse6)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse4 (<= (+ main_~new_data~0 2) .cse8)) (.cse5 (<= 0 main_~i~0)) (.cse7 (<= main_~expected~0 |main_#t~ret17|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ .cse6 1) (+ main_~i~0 main_~len~0)) .cse7 (<= main_~i~0 1)) (and .cse0 .cse1 (<= main_~i~0 0) .cse2 .cse3 .cse4 .cse5 .cse7 (<= (+ .cse6 2) .cse8))))) [2020-10-23 20:42:28,708 INFO L270 CegarLoopResult]: At program point L620-1(lines 618 621) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse7 (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse1 (+ .cse7 1)) (.cse0 (* 2 main_~len~0))) (let ((.cse2 (not (= .cse8 main_~s~0.base))) (.cse4 (<= .cse1 .cse0)) (.cse5 (= main_~s~0.offset 0))) (or (let ((.cse3 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (= main_~len~0 2) (<= .cse0 .cse1) .cse2 (<= (+ main_~i~0 2) .cse3) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= 0 main_~i~0) .cse4 (<= (+ .cse3 2) .cse0) .cse5)) (let ((.cse6 (+ main_~new_data~0 1))) (and .cse2 (<= .cse6 .cse0) (<= 1 main_~i~0) (<= main_~len~0 (+ main_~i~0 1)) (<= (+ main_~i~0 main_~len~0) .cse7) (<= .cse0 .cse6) .cse4 .cse5 (<= main_~i~0 1)))))))) [2020-10-23 20:42:28,708 INFO L270 CegarLoopResult]: At program point L616(line 616) the Hoare annotation is: (and (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L616-1(line 616) the Hoare annotation is: (and (= |main_#t~ret14.offset| 0) (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) 4) |main_#t~ret14.base|))) [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L616-2(line 616) the Hoare annotation is: (and (= |main_#t~ret14.offset| 0) (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) 4) |main_#t~ret14.base|)) (= main_~s~0.offset 0)) [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L625(lines 613 632) the Hoare annotation is: false [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L617(line 617) the Hoare annotation is: (and (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)) (= main_~s~0.offset 0)) [2020-10-23 20:42:28,709 INFO L277 CegarLoopResult]: At program point L577(line 577) the Hoare annotation is: true [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L576(lines 576 578) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= |#memory_int| |old(#memory_int)|) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L575(line 575) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,709 INFO L270 CegarLoopResult]: At program point L576-1(lines 576 578) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= |#memory_int| |old(#memory_int)|) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2020-10-23 20:42:28,710 INFO L270 CegarLoopResult]: At program point L575-1(line 575) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= |#memory_int| |old(#memory_int)|) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2020-10-23 20:42:28,710 INFO L270 CegarLoopResult]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:42:28,710 INFO L270 CegarLoopResult]: At program point node_createEXIT(lines 574 582) the Hoare annotation is: (and (= |node_create_#res.offset| 0) (= (select |#valid| |node_create_#res.base|) 1) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= (select |old(#valid)| |node_create_#res.base|) 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2020-10-23 20:42:28,710 INFO L270 CegarLoopResult]: At program point node_createFINAL(lines 574 582) the Hoare annotation is: (and (= |node_create_#res.offset| 0) (= (select |#valid| |node_create_#res.base|) 1) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= (select |old(#valid)| |node_create_#res.base|) 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2020-10-23 20:42:28,710 INFO L270 CegarLoopResult]: At program point L580(line 580) the Hoare annotation is: (and (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2020-10-23 20:42:28,710 INFO L270 CegarLoopResult]: At program point L579(line 579) the Hoare annotation is: (and (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2020-10-23 20:42:28,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,739 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,739 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,739 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,739 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,739 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,740 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,740 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,740 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,740 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,740 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,741 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,741 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,741 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,741 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,741 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,741 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,744 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,747 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,747 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,754 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,754 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,754 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,754 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,754 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,754 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,758 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,758 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,759 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,759 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,759 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,759 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,759 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,759 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,760 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,765 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,765 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,766 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,766 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,766 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,766 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,768 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,768 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,769 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,769 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,769 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,769 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,769 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,773 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:707) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-10-23 20:42:28,776 INFO L168 Benchmark]: Toolchain (without parser) took 151678.03 ms. Allocated memory was 152.0 MB in the beginning and 234.9 MB in the end (delta: 82.8 MB). Free memory was 109.6 MB in the beginning and 143.1 MB in the end (delta: -33.6 MB). Peak memory consumption was 125.7 MB. Max. memory is 8.0 GB. [2020-10-23 20:42:28,776 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 152.0 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:42:28,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.74 ms. Allocated memory is still 152.0 MB. Free memory was 108.9 MB in the beginning and 124.4 MB in the end (delta: -15.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:42:28,776 INFO L168 Benchmark]: Boogie Preprocessor took 124.12 ms. Allocated memory is still 152.0 MB. Free memory was 124.4 MB in the beginning and 121.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:42:28,777 INFO L168 Benchmark]: RCFGBuilder took 903.05 ms. Allocated memory was 152.0 MB in the beginning and 195.0 MB in the end (delta: 43.0 MB). Free memory was 121.4 MB in the beginning and 163.0 MB in the end (delta: -41.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:42:28,777 INFO L168 Benchmark]: TraceAbstraction took 149891.85 ms. Allocated memory was 195.0 MB in the beginning and 234.9 MB in the end (delta: 39.8 MB). Free memory was 162.5 MB in the beginning and 143.1 MB in the end (delta: 19.4 MB). Peak memory consumption was 134.7 MB. Max. memory is 8.0 GB. [2020-10-23 20:42:28,778 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 152.0 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 740.74 ms. Allocated memory is still 152.0 MB. Free memory was 108.9 MB in the beginning and 124.4 MB in the end (delta: -15.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 124.12 ms. Allocated memory is still 152.0 MB. Free memory was 124.4 MB in the beginning and 121.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 903.05 ms. Allocated memory was 152.0 MB in the beginning and 195.0 MB in the end (delta: 43.0 MB). Free memory was 121.4 MB in the beginning and 163.0 MB in the end (delta: -41.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 149891.85 ms. Allocated memory was 195.0 MB in the beginning and 234.9 MB in the end (delta: 39.8 MB). Free memory was 162.5 MB in the beginning and 143.1 MB in the end (delta: 19.4 MB). Peak memory consumption was 134.7 MB. Max. memory is 8.0 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$.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$.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 - 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$.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$.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$.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 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$.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$.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 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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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_$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_$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_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_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_$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_int - 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_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_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_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_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_$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_$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_$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_$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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 600]: Loop Invariant [2020-10-23 20:42:28,788 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,788 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,789 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,789 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((index + 1 <= \old(index) && 2 <= \old(index)) || ((index + 1 <= \old(index) && (((head == #memory_$Pointer$[head][4] && head == #memory_$Pointer$[head][4]) || 1 <= head) || head + 1 <= 0)) && 1 <= \old(index))) || ((\old(index) == index && head == head) && head == head) - InvariantResult [Line: 618]: Loop Invariant [2020-10-23 20:42:28,790 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,790 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,791 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,791 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,791 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,791 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,791 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,792 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,795 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((!(#memory_$Pointer$[s][4] == s) && i + 1 <= len) && 1 <= i) && len <= i + 1) && s == 0) && i <= 1) || ((((((((len == 2 && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && !(#memory_$Pointer$[s][4] == s)) && new_data + 1 <= 2 * len) && i + 2 <= len) && 0 <= i) && 2 * len <= new_data + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && s == 0)) || (((((((((len == 2 && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && len <= unknown-#memory_int-unknown[s][s]) && !(#memory_$Pointer$[s][4] == s)) && i + 2 <= len) && len <= new_data) && new_data + 2 <= 2 * len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == 0) - InvariantResult [Line: 622]: Loop Invariant [2020-10-23 20:42:28,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((len == 2 && len <= unknown-#memory_int-unknown[s][s]) && len <= new_data) && i + 1 <= 0) && new_data + 2 <= 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) || ((((((((len == 2 && len <= unknown-#memory_int-unknown[s][s]) && !(#memory_$Pointer$[s][4] == s)) && len <= new_data) && new_data + 2 <= 2 * len) && i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && unknown-#memory_int-unknown[s][s] + 1 <= i + len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && s == 0)) || (((((len == 2 && i + 2 <= unknown-#memory_int-unknown[s][s]) && len <= new_data) && new_data + 2 <= 2 * len) && 0 <= i) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) - InvariantResult [Line: 607]: Loop Invariant [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((#memory_$Pointer$ == \old(#memory_$Pointer$) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (((#memory_$Pointer$[head][4] == head || head + 1 <= 0) || 1 <= head) || ((head == #memory_$Pointer$[head][4] && data == \old(data)) && #memory_$Pointer$[head][4] == head))) || ((((((#memory_$Pointer$ == \old(#memory_$Pointer$) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && head == head) && \old(index) == index) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((#memory_$Pointer$ == \old(#memory_$Pointer$) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) - InvariantResult [Line: 585]: Loop Invariant [2020-10-23 20:42:28,817 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,817 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,817 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,818 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,818 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,818 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-23 20:42:28,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-23 20:42:28,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-23 20:42:28,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((1 == \valid[new_head] && \valid[head] == 1) && \old(len) <= len + 1) || (((((1 == \valid[new_head] && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(head == #memory_$Pointer$[head][4])) && new_head == 0) && \valid[head] == 1) && head == 0)) || (((((#memory_$Pointer$ == \old(#memory_$Pointer$) && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 592]: Procedure Contract for sll_destroy Derived contract for procedure sll_destroy: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:553) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...