/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -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.1-dev-36cd7be [2021-02-23 23:09:06,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 23:09:06,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 23:09:06,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 23:09:06,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 23:09:06,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 23:09:06,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 23:09:06,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 23:09:06,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 23:09:06,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 23:09:06,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 23:09:06,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 23:09:06,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 23:09:06,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 23:09:06,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 23:09:06,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 23:09:06,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 23:09:06,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 23:09:06,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 23:09:06,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 23:09:06,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 23:09:06,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 23:09:06,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 23:09:06,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 23:09:06,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 23:09:06,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 23:09:06,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 23:09:06,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 23:09:06,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 23:09:06,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 23:09:06,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 23:09:06,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 23:09:06,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 23:09:06,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 23:09:06,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 23:09:06,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 23:09:06,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 23:09:06,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 23:09:06,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 23:09:06,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 23:09:06,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 23:09:06,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-23 23:09:06,943 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 23:09:06,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 23:09:06,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 23:09:06,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 23:09:06,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 23:09:06,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 23:09:06,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 23:09:06,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 23:09:06,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 23:09:06,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 23:09:06,951 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 23:09:06,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 23:09:06,952 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 23:09:06,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 23:09:06,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 23:09:06,953 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 23:09:06,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 23:09:06,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 23:09:06,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 23:09:06,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 23:09:06,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 23:09:06,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 23:09:06,954 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-23 23:09:07,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 23:09:07,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 23:09:07,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 23:09:07,394 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 23:09:07,395 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 23:09:07,396 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 [2021-02-23 23:09:07,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e43d84a/b76b7affb34e4b6a89c82bbb9e61aea3/FLAGb96d7060e [2021-02-23 23:09:08,198 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 23:09:08,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2021-02-23 23:09:08,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e43d84a/b76b7affb34e4b6a89c82bbb9e61aea3/FLAGb96d7060e [2021-02-23 23:09:08,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e43d84a/b76b7affb34e4b6a89c82bbb9e61aea3 [2021-02-23 23:09:08,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 23:09:08,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 23:09:08,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 23:09:08,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 23:09:08,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 23:09:08,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 11:09:08" (1/1) ... [2021-02-23 23:09:08,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc4412f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:08, skipping insertion in model container [2021-02-23 23:09:08,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 11:09:08" (1/1) ... [2021-02-23 23:09:08,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 23:09:08,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 23:09:08,879 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-02-23 23:09:08,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 23:09:08,894 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 23:09:08,991 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-02-23 23:09:08,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 23:09:09,064 INFO L208 MainTranslator]: Completed translation [2021-02-23 23:09:09,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09 WrapperNode [2021-02-23 23:09:09,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 23:09:09,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 23:09:09,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 23:09:09,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 23:09:09,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (1/1) ... [2021-02-23 23:09:09,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 23:09:09,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 23:09:09,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 23:09:09,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 23:09:09,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (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 [2021-02-23 23:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 23:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 23:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 23:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-02-23 23:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-02-23 23:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-02-23 23:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-02-23 23:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2021-02-23 23:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2021-02-23 23:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2021-02-23 23:09:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2021-02-23 23:09:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 23:09:09,238 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 23:09:09,238 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 23:09:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-02-23 23:09:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-02-23 23:09:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 23:09:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 23:09:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-02-23 23:09:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-02-23 23:09:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-02-23 23:09:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-02-23 23:09:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-02-23 23:09:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-02-23 23:09:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-02-23 23:09:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-02-23 23:09:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-02-23 23:09:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-02-23 23:09:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-02-23 23:09:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-02-23 23:09:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-02-23 23:09:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-02-23 23:09:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-02-23 23:09:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-02-23 23:09:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-02-23 23:09:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-02-23 23:09:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-02-23 23:09:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-02-23 23:09:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-02-23 23:09:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-02-23 23:09:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-02-23 23:09:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-02-23 23:09:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-02-23 23:09:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-02-23 23:09:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-02-23 23:09:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-02-23 23:09:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-02-23 23:09:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-02-23 23:09:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-23 23:09:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-02-23 23:09:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-02-23 23:09:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-02-23 23:09:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-02-23 23:09:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-02-23 23:09:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-02-23 23:09:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-02-23 23:09:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-02-23 23:09:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-02-23 23:09:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-02-23 23:09:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-02-23 23:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-02-23 23:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-02-23 23:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-02-23 23:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-02-23 23:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-02-23 23:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-02-23 23:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-02-23 23:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-02-23 23:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-02-23 23:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-02-23 23:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-02-23 23:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-02-23 23:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-02-23 23:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-02-23 23:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-02-23 23:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-02-23 23:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-02-23 23:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-02-23 23:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-23 23:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-02-23 23:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 23:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2021-02-23 23:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2021-02-23 23:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-02-23 23:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 23:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2021-02-23 23:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 23:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2021-02-23 23:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 23:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 23:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 23:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 23:09:09,694 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-02-23 23:09:09,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 23:09:09,918 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-02-23 23:09:09,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 11:09:09 BoogieIcfgContainer [2021-02-23 23:09:09,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 23:09:09,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 23:09:09,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 23:09:09,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 23:09:09,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 11:09:08" (1/3) ... [2021-02-23 23:09:09,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2506de2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 11:09:09, skipping insertion in model container [2021-02-23 23:09:09,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:09:09" (2/3) ... [2021-02-23 23:09:09,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2506de2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 11:09:09, skipping insertion in model container [2021-02-23 23:09:09,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 11:09:09" (3/3) ... [2021-02-23 23:09:09,929 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-02-23 23:09:09,936 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 23:09:09,942 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 23:09:09,962 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 23:09:09,985 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 23:09:09,985 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 23:09:09,985 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-23 23:09:09,985 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 23:09:09,986 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 23:09:09,986 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 23:09:09,986 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 23:09:09,986 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 23:09:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2021-02-23 23:09:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-23 23:09:10,015 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:10,016 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] [2021-02-23 23:09:10,016 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2073568287, now seen corresponding path program 1 times [2021-02-23 23:09:10,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:10,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1537321416] [2021-02-23 23:09:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:10,215 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:10,216 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:10,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:10,218 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:10,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:10,263 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:10,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:10,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:10,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:10,293 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:10,293 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:10,294 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:10,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 23:09:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:10,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:10,306 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 23:09:10,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1537321416] [2021-02-23 23:09:10,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:09:10,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:09:10,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795429607] [2021-02-23 23:09:10,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:09:10,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:09:10,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:09:10,342 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2021-02-23 23:09:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:10,851 INFO L93 Difference]: Finished difference Result 235 states and 290 transitions. [2021-02-23 23:09:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-02-23 23:09:10,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2021-02-23 23:09:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:10,870 INFO L225 Difference]: With dead ends: 235 [2021-02-23 23:09:10,870 INFO L226 Difference]: Without dead ends: 132 [2021-02-23 23:09:10,877 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 [2021-02-23 23:09:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-02-23 23:09:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2021-02-23 23:09:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-02-23 23:09:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-02-23 23:09:10,968 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2021-02-23 23:09:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:10,968 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-02-23 23:09:10,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:09:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-02-23 23:09:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-23 23:09:10,973 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:10,973 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] [2021-02-23 23:09:10,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 23:09:10,974 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1487845686, now seen corresponding path program 1 times [2021-02-23 23:09:10,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:10,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1842001535] [2021-02-23 23:09:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,077 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,144 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,151 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,151 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 23:09:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,165 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,165 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 23:09:11,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1842001535] [2021-02-23 23:09:11,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:09:11,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-23 23:09:11,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213274684] [2021-02-23 23:09:11,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-23 23:09:11,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-23 23:09:11,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-23 23:09:11,173 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 7 states. [2021-02-23 23:09:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:11,603 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-02-23 23:09:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-02-23 23:09:11,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-02-23 23:09:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:11,607 INFO L225 Difference]: With dead ends: 149 [2021-02-23 23:09:11,608 INFO L226 Difference]: Without dead ends: 96 [2021-02-23 23:09:11,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-02-23 23:09:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-02-23 23:09:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2021-02-23 23:09:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-02-23 23:09:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2021-02-23 23:09:11,629 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42 [2021-02-23 23:09:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:11,630 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2021-02-23 23:09:11,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-23 23:09:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2021-02-23 23:09:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-02-23 23:09:11,632 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:11,632 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] [2021-02-23 23:09:11,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 23:09:11,633 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash -762840836, now seen corresponding path program 1 times [2021-02-23 23:09:11,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:11,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911642727] [2021-02-23 23:09:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,691 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,692 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,725 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,726 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,797 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,798 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:11,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:11,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-23 23:09:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:11,874 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:11,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 23:09:11,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911642727] [2021-02-23 23:09:11,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:11,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-02-23 23:09:11,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854305997] [2021-02-23 23:09:11,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 23:09:11,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 23:09:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-23 23:09:11,892 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 9 states. [2021-02-23 23:09:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:12,345 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2021-02-23 23:09:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-02-23 23:09:12,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2021-02-23 23:09:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:12,347 INFO L225 Difference]: With dead ends: 158 [2021-02-23 23:09:12,348 INFO L226 Difference]: Without dead ends: 105 [2021-02-23 23:09:12,349 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 [2021-02-23 23:09:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-02-23 23:09:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2021-02-23 23:09:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-02-23 23:09:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-02-23 23:09:12,367 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 60 [2021-02-23 23:09:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:12,368 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-02-23 23:09:12,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 23:09:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-02-23 23:09:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-23 23:09:12,372 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:12,373 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] [2021-02-23 23:09:12,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 23:09:12,373 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2138915502, now seen corresponding path program 2 times [2021-02-23 23:09:12,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:12,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [588428176] [2021-02-23 23:09:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:12,480 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,483 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:12,497 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:12,498 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:12,508 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 23:09:12,508 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 23:09:12,509 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,510 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:12,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,536 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:12,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:12,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,585 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:12,592 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,593 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-02-23 23:09:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:12,604 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:12,605 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-02-23 23:09:12,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [588428176] [2021-02-23 23:09:12,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:09:12,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-02-23 23:09:12,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905127069] [2021-02-23 23:09:12,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-02-23 23:09:12,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:12,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-02-23 23:09:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-02-23 23:09:12,616 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 6 states. [2021-02-23 23:09:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:12,926 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-02-23 23:09:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-02-23 23:09:12,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-02-23 23:09:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:12,929 INFO L225 Difference]: With dead ends: 141 [2021-02-23 23:09:12,929 INFO L226 Difference]: Without dead ends: 114 [2021-02-23 23:09:12,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-02-23 23:09:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-02-23 23:09:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2021-02-23 23:09:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-02-23 23:09:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-02-23 23:09:12,945 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 78 [2021-02-23 23:09:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:12,946 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-02-23 23:09:12,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-02-23 23:09:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-02-23 23:09:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-02-23 23:09:12,948 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:12,948 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] [2021-02-23 23:09:12,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 23:09:12,948 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:12,949 INFO L82 PathProgramCache]: Analyzing trace with hash 95378343, now seen corresponding path program 1 times [2021-02-23 23:09:12,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:12,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240843912] [2021-02-23 23:09:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,015 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,015 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,016 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:13,019 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:13,020 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:13,027 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 23:09:13,028 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 23:09:13,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:13,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:13,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-23 23:09:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,146 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-02-23 23:09:13,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240843912] [2021-02-23 23:09:13,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:09:13,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-23 23:09:13,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686706309] [2021-02-23 23:09:13,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 23:09:13,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 23:09:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-02-23 23:09:13,161 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 9 states. [2021-02-23 23:09:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:13,651 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2021-02-23 23:09:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 23:09:13,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2021-02-23 23:09:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:13,653 INFO L225 Difference]: With dead ends: 169 [2021-02-23 23:09:13,653 INFO L226 Difference]: Without dead ends: 123 [2021-02-23 23:09:13,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-02-23 23:09:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-02-23 23:09:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2021-02-23 23:09:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-02-23 23:09:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-02-23 23:09:13,672 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 91 [2021-02-23 23:09:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:13,672 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-02-23 23:09:13,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 23:09:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-02-23 23:09:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-02-23 23:09:13,674 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:13,674 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] [2021-02-23 23:09:13,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 23:09:13,675 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash 261527972, now seen corresponding path program 1 times [2021-02-23 23:09:13,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:13,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417671715] [2021-02-23 23:09:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,759 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:13,766 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:13,767 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:13,775 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:13,776 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:13,786 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:13,787 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:13,798 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 23:09:13,798 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 23:09:13,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,802 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,831 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,836 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,890 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,891 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,901 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-02-23 23:09:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:13,939 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:13,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-02-23 23:09:13,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417671715] [2021-02-23 23:09:13,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:13,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-02-23 23:09:13,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871204544] [2021-02-23 23:09:13,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 23:09:13,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 23:09:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-23 23:09:13,958 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2021-02-23 23:09:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:14,346 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2021-02-23 23:09:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 23:09:14,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2021-02-23 23:09:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:14,348 INFO L225 Difference]: With dead ends: 147 [2021-02-23 23:09:14,348 INFO L226 Difference]: Without dead ends: 120 [2021-02-23 23:09:14,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-02-23 23:09:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-02-23 23:09:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2021-02-23 23:09:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-02-23 23:09:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2021-02-23 23:09:14,365 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 98 [2021-02-23 23:09:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:14,366 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2021-02-23 23:09:14,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 23:09:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2021-02-23 23:09:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-02-23 23:09:14,367 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:14,368 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] [2021-02-23 23:09:14,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 23:09:14,368 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1290697615, now seen corresponding path program 2 times [2021-02-23 23:09:14,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:14,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197665357] [2021-02-23 23:09:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,421 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,421 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,422 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:14,425 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:14,426 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:14,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:14,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,439 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,462 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,519 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,524 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,530 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,530 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,536 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,560 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,561 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 23:09:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:14,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,580 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:14,581 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:14,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:14,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-02-23 23:09:14,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197665357] [2021-02-23 23:09:14,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:09:14,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 23:09:14,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619092544] [2021-02-23 23:09:14,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 23:09:14,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 23:09:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-02-23 23:09:14,619 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 10 states. [2021-02-23 23:09:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:15,118 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-02-23 23:09:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-23 23:09:15,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2021-02-23 23:09:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:15,122 INFO L225 Difference]: With dead ends: 157 [2021-02-23 23:09:15,122 INFO L226 Difference]: Without dead ends: 131 [2021-02-23 23:09:15,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-02-23 23:09:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-02-23 23:09:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-02-23 23:09:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-23 23:09:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2021-02-23 23:09:15,152 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 111 [2021-02-23 23:09:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2021-02-23 23:09:15,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 23:09:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2021-02-23 23:09:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-02-23 23:09:15,156 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:15,156 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] [2021-02-23 23:09:15,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 23:09:15,156 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1932003720, now seen corresponding path program 1 times [2021-02-23 23:09:15,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:15,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919280882] [2021-02-23 23:09:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:15,374 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,374 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:15,377 WARN L141 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-02-23 23:09:15,378 WARN L147 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size 12 [2021-02-23 23:09:15,384 WARN L141 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-02-23 23:09:15,386 WARN L147 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size 12 [2021-02-23 23:09:15,397 WARN L141 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size [2021-02-23 23:09:15,398 WARN L147 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size 22 [2021-02-23 23:09:15,417 WARN L141 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-02-23 23:09:15,418 WARN L147 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size 26 [2021-02-23 23:09:15,434 WARN L141 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-02-23 23:09:15,436 WARN L147 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-02-23 23:09:15,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,462 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-02-23 23:09:15,480 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-02-23 23:09:15,498 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,499 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-02-23 23:09:15,520 WARN L141 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-02-23 23:09:15,521 WARN L147 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size 9 [2021-02-23 23:09:15,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:15,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:15,575 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:15,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:15,640 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:15,641 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,641 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:15,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:15,675 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:15,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-23 23:09:15,714 WARN L141 QuantifierPusher]: treesize reduction 5, result has 61.5 percent of original size [2021-02-23 23:09:15,715 WARN L147 QuantifierPusher]: treesize reduction 5, result has 61.5 percent of original size 8 [2021-02-23 23:09:15,737 WARN L141 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size [2021-02-23 23:09:15,738 WARN L147 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size 14 [2021-02-23 23:09:15,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-02-23 23:09:15,791 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-02-23 23:09:15,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:15,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:15,828 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,829 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:15,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:15,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:15,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:15,920 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,920 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:15,948 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 23:09:15,984 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:15,984 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 23:09:16,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 23:09:16,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:16,142 WARN L141 QuantifierPusher]: treesize reduction 12, result has 57.1 percent of original size [2021-02-23 23:09:16,143 WARN L147 QuantifierPusher]: treesize reduction 12, result has 57.1 percent of original size 16 [2021-02-23 23:09:16,186 WARN L141 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-02-23 23:09:16,186 WARN L147 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size 19 [2021-02-23 23:09:16,240 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,243 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-02-23 23:09:16,304 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,306 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-02-23 23:09:16,479 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-02-23 23:09:16,483 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,485 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-02-23 23:09:16,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:16,593 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,594 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-02-23 23:09:16,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,661 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-02-23 23:09:16,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 23:09:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:16,770 WARN L141 QuantifierPusher]: treesize reduction 12, result has 50.0 percent of original size [2021-02-23 23:09:16,771 WARN L147 QuantifierPusher]: treesize reduction 12, result has 50.0 percent of original size 12 [2021-02-23 23:09:16,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 23:09:16,889 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,890 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 23:09:16,955 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:16,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 23:09:17,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:17,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 23:09:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-23 23:09:17,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919280882] [2021-02-23 23:09:17,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:17,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2021-02-23 23:09:17,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732587587] [2021-02-23 23:09:17,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-02-23 23:09:17,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-02-23 23:09:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1550, Unknown=0, NotChecked=0, Total=1640 [2021-02-23 23:09:17,182 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 41 states. [2021-02-23 23:09:19,092 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-02-23 23:09:19,524 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-02-23 23:09:19,761 WARN L202 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-02-23 23:09:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:23,166 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2021-02-23 23:09:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-02-23 23:09:23,167 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2021-02-23 23:09:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:23,169 INFO L225 Difference]: With dead ends: 218 [2021-02-23 23:09:23,170 INFO L226 Difference]: Without dead ends: 215 [2021-02-23 23:09:23,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=411, Invalid=5751, Unknown=0, NotChecked=0, Total=6162 [2021-02-23 23:09:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-02-23 23:09:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 156. [2021-02-23 23:09:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-02-23 23:09:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2021-02-23 23:09:23,207 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 118 [2021-02-23 23:09:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:23,207 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2021-02-23 23:09:23,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2021-02-23 23:09:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2021-02-23 23:09:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-23 23:09:23,209 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:23,210 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] [2021-02-23 23:09:23,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 23:09:23,210 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash -539169647, now seen corresponding path program 2 times [2021-02-23 23:09:23,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:23,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [346642557] [2021-02-23 23:09:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,262 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,267 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:23,273 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:23,274 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:23,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:23,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,315 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,316 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,346 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,346 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,351 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,352 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,356 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,357 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,377 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,383 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 23:09:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:23,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,397 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:23,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:23,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:23,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,421 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:23,432 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:23,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-02-23 23:09:23,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [346642557] [2021-02-23 23:09:23,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:23,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-23 23:09:23,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256781769] [2021-02-23 23:09:23,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-23 23:09:23,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-23 23:09:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-02-23 23:09:23,465 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 12 states. [2021-02-23 23:09:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:24,300 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2021-02-23 23:09:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 23:09:24,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2021-02-23 23:09:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:24,305 INFO L225 Difference]: With dead ends: 208 [2021-02-23 23:09:24,305 INFO L226 Difference]: Without dead ends: 164 [2021-02-23 23:09:24,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-02-23 23:09:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-02-23 23:09:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-02-23 23:09:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-02-23 23:09:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2021-02-23 23:09:24,340 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 125 [2021-02-23 23:09:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:24,341 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2021-02-23 23:09:24,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-23 23:09:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2021-02-23 23:09:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-23 23:09:24,343 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:24,343 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] [2021-02-23 23:09:24,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-23 23:09:24,343 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash -617921473, now seen corresponding path program 3 times [2021-02-23 23:09:24,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:24,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290529295] [2021-02-23 23:09:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,415 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:24,420 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:24,420 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:24,428 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:24,428 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:24,441 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:24,442 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:24,452 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 23:09:24,453 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 23:09:24,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,492 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,493 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,551 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,552 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,558 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,583 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,601 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,601 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:24,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:24,627 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,627 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:24,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-02-23 23:09:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:24,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:24,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-02-23 23:09:24,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290529295] [2021-02-23 23:09:24,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:24,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-23 23:09:24,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684368264] [2021-02-23 23:09:24,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-23 23:09:24,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:24,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-23 23:09:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-23 23:09:24,684 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 12 states. [2021-02-23 23:09:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:25,423 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2021-02-23 23:09:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-23 23:09:25,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2021-02-23 23:09:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:25,425 INFO L225 Difference]: With dead ends: 235 [2021-02-23 23:09:25,426 INFO L226 Difference]: Without dead ends: 159 [2021-02-23 23:09:25,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-02-23 23:09:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-02-23 23:09:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2021-02-23 23:09:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-02-23 23:09:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2021-02-23 23:09:25,453 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 125 [2021-02-23 23:09:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:25,454 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2021-02-23 23:09:25,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-23 23:09:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2021-02-23 23:09:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-23 23:09:25,456 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:25,456 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] [2021-02-23 23:09:25,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-23 23:09:25,457 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1043789163, now seen corresponding path program 4 times [2021-02-23 23:09:25,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:25,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [459535167] [2021-02-23 23:09:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,505 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,505 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:25,509 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:25,510 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:25,518 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 23:09:25,518 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 23:09:25,519 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,519 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,571 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,611 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:25,619 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,620 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:25,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,630 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:25,641 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,642 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:25,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-02-23 23:09:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,674 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-02-23 23:09:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:25,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:25,683 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-02-23 23:09:25,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [459535167] [2021-02-23 23:09:25,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:25,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-02-23 23:09:25,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205014776] [2021-02-23 23:09:25,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 23:09:25,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 23:09:25,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-02-23 23:09:25,706 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 11 states. [2021-02-23 23:09:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:26,535 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2021-02-23 23:09:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-02-23 23:09:26,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2021-02-23 23:09:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:26,538 INFO L225 Difference]: With dead ends: 220 [2021-02-23 23:09:26,538 INFO L226 Difference]: Without dead ends: 130 [2021-02-23 23:09:26,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-02-23 23:09:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-02-23 23:09:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2021-02-23 23:09:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-02-23 23:09:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2021-02-23 23:09:26,563 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 125 [2021-02-23 23:09:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:26,563 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2021-02-23 23:09:26,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 23:09:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2021-02-23 23:09:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-02-23 23:09:26,565 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:26,566 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] [2021-02-23 23:09:26,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-23 23:09:26,566 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:26,567 INFO L82 PathProgramCache]: Analyzing trace with hash 480324644, now seen corresponding path program 1 times [2021-02-23 23:09:26,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:26,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626652475] [2021-02-23 23:09:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:26,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:26,670 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,672 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:26,675 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:26,676 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:26,683 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:26,684 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:26,691 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:26,693 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:26,703 WARN L141 QuantifierPusher]: treesize reduction 2, result has 85.7 percent of original size [2021-02-23 23:09:26,705 WARN L147 QuantifierPusher]: treesize reduction 2, result has 85.7 percent of original size 12 [2021-02-23 23:09:26,717 WARN L141 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-02-23 23:09:26,718 WARN L147 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size 14 [2021-02-23 23:09:26,731 WARN L141 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-02-23 23:09:26,732 WARN L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-02-23 23:09:26,749 WARN L141 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-02-23 23:09:26,750 WARN L147 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size 24 [2021-02-23 23:09:26,767 WARN L141 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-02-23 23:09:26,768 WARN L147 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size 24 [2021-02-23 23:09:26,797 WARN L141 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-02-23 23:09:26,799 WARN L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-02-23 23:09:26,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,820 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 23:09:26,835 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-23 23:09:26,836 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-23 23:09:26,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,856 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:26,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:26,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:26,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:26,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,960 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:26,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:26,964 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:26,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:26,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,970 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:26,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:26,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:26,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:27,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:27,008 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,009 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:27,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-23 23:09:27,051 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,052 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:27,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 23:09:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:27,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:27,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-23 23:09:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:27,085 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:27,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:27,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:27,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-23 23:09:27,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626652475] [2021-02-23 23:09:27,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:27,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-02-23 23:09:27,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103308439] [2021-02-23 23:09:27,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-02-23 23:09:27,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-02-23 23:09:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-02-23 23:09:27,192 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 23 states. [2021-02-23 23:09:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:29,627 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2021-02-23 23:09:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-23 23:09:29,628 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 135 [2021-02-23 23:09:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:29,630 INFO L225 Difference]: With dead ends: 170 [2021-02-23 23:09:29,631 INFO L226 Difference]: Without dead ends: 159 [2021-02-23 23:09:29,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2021-02-23 23:09:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-02-23 23:09:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-02-23 23:09:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-02-23 23:09:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-02-23 23:09:29,661 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 135 [2021-02-23 23:09:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:29,661 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-02-23 23:09:29,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-02-23 23:09:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-02-23 23:09:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-02-23 23:09:29,664 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:29,664 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] [2021-02-23 23:09:29,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-23 23:09:29,664 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2123308427, now seen corresponding path program 2 times [2021-02-23 23:09:29,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:29,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294369922] [2021-02-23 23:09:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,714 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,715 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,717 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,718 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:29,721 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:29,722 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:29,729 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:29,730 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:29,738 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:29,739 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:29,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:29,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,813 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,814 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,839 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,839 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 23:09:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,850 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-23 23:09:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:29,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:29,859 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,860 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:29,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,870 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 23:09:29,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:29,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:09:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-02-23 23:09:29,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294369922] [2021-02-23 23:09:29,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 23:09:29,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-02-23 23:09:29,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109267093] [2021-02-23 23:09:29,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-23 23:09:29,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-23 23:09:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-23 23:09:29,924 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 13 states. [2021-02-23 23:09:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:30,615 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2021-02-23 23:09:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 23:09:30,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 142 [2021-02-23 23:09:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:30,618 INFO L225 Difference]: With dead ends: 191 [2021-02-23 23:09:30,618 INFO L226 Difference]: Without dead ends: 135 [2021-02-23 23:09:30,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-02-23 23:09:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-02-23 23:09:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-02-23 23:09:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-02-23 23:09:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2021-02-23 23:09:30,644 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 142 [2021-02-23 23:09:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:30,645 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2021-02-23 23:09:30,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-23 23:09:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2021-02-23 23:09:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-02-23 23:09:30,647 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:09:30,648 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] [2021-02-23 23:09:30,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-23 23:09:30,648 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:09:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:09:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1657400056, now seen corresponding path program 3 times [2021-02-23 23:09:30,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:09:30,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387575207] [2021-02-23 23:09:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:09:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,700 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 23:09:30,704 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:30,705 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:30,712 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:30,713 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:30,721 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:30,722 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:30,732 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:30,733 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:30,744 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 23:09:30,744 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 23:09:30,755 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 23:09:30,756 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 23:09:30,756 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,757 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:09:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 23:09:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,814 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 23:09:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,820 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 23:09:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,826 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 23:09:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,849 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 23:09:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 23:09:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,860 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-23 23:09:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-02-23 23:09:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:09:30,868 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:09:30,869 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:09:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-02-23 23:09:30,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387575207] [2021-02-23 23:09:30,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:09:30,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 23:09:30,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171779879] [2021-02-23 23:09:30,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 23:09:30,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:09:30,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 23:09:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-02-23 23:09:30,902 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 11 states. [2021-02-23 23:09:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:09:31,346 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-02-23 23:09:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 23:09:31,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2021-02-23 23:09:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:09:31,350 INFO L225 Difference]: With dead ends: 160 [2021-02-23 23:09:31,350 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 23:09:31,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-02-23 23:09:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 23:09:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 23:09:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 23:09:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 23:09:31,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2021-02-23 23:09:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:09:31,353 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 23:09:31,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 23:09:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 23:09:31,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 23:09:31,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-23 23:09:31,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 23:09:32,937 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2021-02-23 23:09:33,135 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2021-02-23 23:09:33,253 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2021-02-23 23:09:33,399 WARN L202 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2021-02-23 23:09:33,657 WARN L202 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-23 23:09:33,761 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-02-23 23:09:33,951 WARN L202 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2021-02-23 23:09:34,071 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2021-02-23 23:09:34,340 WARN L202 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-23 23:09:34,614 WARN L202 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-02-23 23:09:34,877 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-23 23:09:35,232 WARN L202 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-02-23 23:09:35,382 WARN L202 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-02-23 23:09:35,750 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-02-23 23:09:35,892 WARN L202 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2021-02-23 23:09:36,170 WARN L202 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2021-02-23 23:09:36,366 WARN L202 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-02-23 23:09:36,567 WARN L202 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-02-23 23:09:36,708 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2021-02-23 23:09:36,945 WARN L202 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2021-02-23 23:09:37,157 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2021-02-23 23:09:37,402 WARN L202 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2021-02-23 23:09:37,950 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2021-02-23 23:09:38,085 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2021-02-23 23:09:38,349 WARN L202 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-02-23 23:09:38,526 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2021-02-23 23:09:38,689 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-23 23:09:39,033 WARN L202 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2021-02-23 23:09:39,167 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-02-23 23:09:39,335 WARN L202 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-02-23 23:09:39,804 WARN L202 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-23 23:09:39,809 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-02-23 23:09:39,809 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-02-23 23:09:39,809 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-02-23 23:09:39,809 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-02-23 23:09:39,810 INFO L189 CegarLoopUtils]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-02-23 23:09:39,810 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-02-23 23:09:39,810 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 23:09:39,810 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2021-02-23 23:09:39,810 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-23 23:09:39,810 INFO L192 CegarLoopUtils]: At program point L12-1(line 12) the Hoare annotation is: true [2021-02-23 23:09:39,810 INFO L192 CegarLoopUtils]: At program point L12-2(line 12) the Hoare annotation is: true [2021-02-23 23:09:39,811 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,811 INFO L192 CegarLoopUtils]: At program point L12-3(line 12) the Hoare annotation is: true [2021-02-23 23:09:39,811 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 23:09:39,811 INFO L192 CegarLoopUtils]: At program point myexitENTRY(lines 571 573) the Hoare annotation is: true [2021-02-23 23:09:39,811 INFO L192 CegarLoopUtils]: At program point L572(line 572) the Hoare annotation is: true [2021-02-23 23:09:39,811 INFO L189 CegarLoopUtils]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2021-02-23 23:09:39,811 INFO L192 CegarLoopUtils]: At program point L595(line 595) the Hoare annotation is: true [2021-02-23 23:09:39,811 INFO L192 CegarLoopUtils]: At program point L594(line 594) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L192 CegarLoopUtils]: At program point L595-1(line 595) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L192 CegarLoopUtils]: At program point L594-1(line 594) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L192 CegarLoopUtils]: At program point L594-2(line 594) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L192 CegarLoopUtils]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L192 CegarLoopUtils]: At program point L593-3(lines 592 598) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L192 CegarLoopUtils]: At program point sll_destroyEXIT(lines 592 598) the Hoare annotation is: true [2021-02-23 23:09:39,812 INFO L185 CegarLoopUtils]: At program point sll_destroyENTRY(lines 592 598) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-02-23 23:09:39,813 INFO L185 CegarLoopUtils]: 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 (<= 1 sll_update_at_~index) .cse1 (= |sll_update_at_#in~index| sll_update_at_~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|)))) [2021-02-23 23:09:39,813 INFO L185 CegarLoopUtils]: At program point L608(line 608) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (or (and (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |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) (= sll_update_at_~data |sll_update_at_#in~data|))) (<= 1 |sll_update_at_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-23 23:09:39,813 INFO L185 CegarLoopUtils]: At program point L609-1(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 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 .cse2 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse3 (<= 2 |sll_update_at_#in~index|)) (and .cse0 (<= 1 sll_update_at_~index) .cse1 .cse2 (= |sll_update_at_#in~index| sll_update_at_~index) .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)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse4 sll_update_at_~head.base))))))) [2021-02-23 23:09:39,813 INFO L185 CegarLoopUtils]: At program point L608-1(line 608) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (or (and (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)) (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) (= |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)|)) [2021-02-23 23:09:39,814 INFO L185 CegarLoopUtils]: 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))))))) [2021-02-23 23:09:39,814 INFO L185 CegarLoopUtils]: 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)|)) [2021-02-23 23:09:39,814 INFO L185 CegarLoopUtils]: At program point L608-2(line 608) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (let ((.cse4 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (.cse3 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4)) (.cse1 (<= (+ |sll_update_at_#in~head.offset| 1) 0)) (.cse2 (<= 1 |sll_update_at_#in~head.offset|))) (and .cse0 (or .cse1 .cse2 (and (= sll_update_at_~data |sll_update_at_#in~data|) (= |sll_update_at_#t~mem12.base| .cse3) (= |sll_update_at_#t~mem12.offset| .cse4))) (<= 1 sll_update_at_~index) .cse5 (= |sll_update_at_#in~index| sll_update_at_~index) .cse6 (or (= .cse3 |sll_update_at_#in~head.base|) (and (= sll_update_at_~head.offset .cse4) (= .cse3 sll_update_at_~head.base)) .cse1 .cse2))) (and .cse0 .cse5 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse6 (<= 2 |sll_update_at_#in~index|)))) [2021-02-23 23:09:39,814 INFO L185 CegarLoopUtils]: 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)|)) [2021-02-23 23:09:39,815 INFO L185 CegarLoopUtils]: 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|)))) [2021-02-23 23:09:39,815 INFO L185 CegarLoopUtils]: 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)))) [2021-02-23 23:09:39,815 INFO L185 CegarLoopUtils]: 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|))))) [2021-02-23 23:09:39,816 INFO L185 CegarLoopUtils]: 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|))))) [2021-02-23 23:09:39,816 INFO L185 CegarLoopUtils]: 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)|)) [2021-02-23 23:09:39,816 INFO L189 CegarLoopUtils]: For program point __bswap_32ENTRY(lines 74 78) no Hoare annotation was computed. [2021-02-23 23:09:39,816 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-02-23 23:09:39,816 INFO L189 CegarLoopUtils]: For program point L77-1(line 77) no Hoare annotation was computed. [2021-02-23 23:09:39,816 INFO L189 CegarLoopUtils]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2021-02-23 23:09:39,816 INFO L189 CegarLoopUtils]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2021-02-23 23:09:39,817 INFO L185 CegarLoopUtils]: 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)))) [2021-02-23 23:09:39,817 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,817 INFO L185 CegarLoopUtils]: 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))))) [2021-02-23 23:09:39,817 INFO L185 CegarLoopUtils]: 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|))) [2021-02-23 23:09:39,817 INFO L185 CegarLoopUtils]: 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))))) [2021-02-23 23:09:39,818 INFO L185 CegarLoopUtils]: 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)))) [2021-02-23 23:09:39,818 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,818 INFO L185 CegarLoopUtils]: 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)))) [2021-02-23 23:09:39,818 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,818 INFO L185 CegarLoopUtils]: 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)))) [2021-02-23 23:09:39,819 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,819 INFO L185 CegarLoopUtils]: 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))))) [2021-02-23 23:09:39,819 INFO L185 CegarLoopUtils]: 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|)))) [2021-02-23 23:09:39,819 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,819 INFO L185 CegarLoopUtils]: 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)))) [2021-02-23 23:09:39,820 INFO L189 CegarLoopUtils]: For program point __bswap_64ENTRY(lines 79 83) no Hoare annotation was computed. [2021-02-23 23:09:39,820 INFO L189 CegarLoopUtils]: For program point L82-1(line 82) no Hoare annotation was computed. [2021-02-23 23:09:39,820 INFO L189 CegarLoopUtils]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2021-02-23 23:09:39,820 INFO L189 CegarLoopUtils]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2021-02-23 23:09:39,820 INFO L189 CegarLoopUtils]: For program point L82(line 82) no Hoare annotation was computed. [2021-02-23 23:09:39,820 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 23:09:39,820 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 23:09:39,820 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 23:09:39,820 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 23:09:39,821 INFO L192 CegarLoopUtils]: At program point sll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2021-02-23 23:09:39,821 INFO L185 CegarLoopUtils]: 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)))))) [2021-02-23 23:09:39,821 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,821 INFO L185 CegarLoopUtils]: 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_~index))) [2021-02-23 23:09:39,821 INFO L185 CegarLoopUtils]: 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|) (<= 1 sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) [2021-02-23 23:09:39,822 INFO L185 CegarLoopUtils]: 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_~index)) (and .cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)))) [2021-02-23 23:09:39,822 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,822 INFO L185 CegarLoopUtils]: 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|) (<= 1 sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) [2021-02-23 23:09:39,822 INFO L185 CegarLoopUtils]: 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|)))) [2021-02-23 23:09:39,822 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,823 INFO L185 CegarLoopUtils]: 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_~index)))) [2021-02-23 23:09:39,823 INFO L185 CegarLoopUtils]: 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|)))) [2021-02-23 23:09:39,823 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,823 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,824 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 613 632) the Hoare annotation is: true [2021-02-23 23:09:39,824 INFO L185 CegarLoopUtils]: At program point L630(line 630) the Hoare annotation is: false [2021-02-23 23:09:39,824 INFO L185 CegarLoopUtils]: At program point L622-2(lines 622 627) the Hoare annotation is: (let ((.cse3 (+ main_~i~0 2)) (.cse7 (* 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)) (.cse4 (<= (+ main_~new_data~0 2) .cse7)) (.cse5 (<= main_~len~0 .cse3))) (or (and .cse0 .cse1 .cse2 (<= .cse3 main_~len~0) .cse4 .cse5 (<= (+ .cse6 2) .cse7)) (and .cse0 .cse1 (<= (+ main_~i~0 1) main_~len~0) .cse2 .cse4 (<= (+ .cse6 1) (+ main_~i~0 main_~len~0)) .cse5)))) [2021-02-23 23:09:39,824 INFO L185 CegarLoopUtils]: At program point L622-3(line 622) the Hoare annotation is: (let ((.cse7 (+ main_~i~0 2)) (.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)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse8)) (.cse5 (<= main_~len~0 .cse7))) (or (let ((.cse2 (+ .cse6 1))) (and .cse0 .cse1 (<= .cse2 (+ main_~len~0 |main_#t~post16|)) (<= (+ main_~i~0 1) main_~len~0) .cse3 .cse4 (<= (+ |main_#t~post16| 1) main_~len~0) (<= .cse2 (+ main_~i~0 main_~len~0)) .cse5)) (and .cse0 .cse1 .cse3 (<= .cse7 main_~len~0) .cse4 .cse5 (<= (+ |main_#t~post16| 2) main_~len~0) (<= (+ .cse6 2) .cse8))))) [2021-02-23 23:09:39,824 INFO L185 CegarLoopUtils]: 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)) [2021-02-23 23:09:39,825 INFO L185 CegarLoopUtils]: 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_~i~0 2) .cse1) .cse2 .cse3 (<= 0 main_~i~0) (<= (+ |main_#t~post16| 1) main_~len~0)) (and .cse0 (<= main_~len~0 .cse1) .cse2 .cse3 (<= (+ |main_#t~post16| 2) main_~len~0) (<= (+ .cse1 2) .cse4) (<= (+ main_~i~0 3) main_~len~0))))) [2021-02-23 23:09:39,825 INFO L185 CegarLoopUtils]: At program point L622-5(lines 622 627) the Hoare annotation is: (let ((.cse8 (* 2 main_~len~0)) (.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (<= main_~len~0 .cse7)) (.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse8)) (.cse9 (<= (+ .cse7 2) .cse8))) (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 .cse1 (not (= .cse2 main_~s~0.base)) .cse3 .cse4 (<= .cse5 .cse6) (<= (+ .cse7 1) .cse5) (<= (+ .cse6 1) .cse8) (= main_~s~0.offset 0)))) (and .cse0 .cse1 .cse3 .cse4 .cse9 (<= (+ main_~i~0 3) main_~len~0)) (and .cse0 (<= (+ main_~i~0 2) .cse7) .cse3 .cse4 (<= 0 main_~i~0) .cse9)))) [2021-02-23 23:09:39,825 INFO L192 CegarLoopUtils]: At program point L622-6(lines 622 627) the Hoare annotation is: true [2021-02-23 23:09:39,825 INFO L185 CegarLoopUtils]: At program point L618-3(line 618) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse9 (+ .cse5 1)) (.cse4 (* 2 main_~len~0)) (.cse6 (+ |main_#t~post15| 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse6 main_~len~0)) (.cse2 (not (= .cse11 main_~s~0.base))) (.cse7 (<= .cse9 .cse4)) (.cse8 (= 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) (<= main_~len~0 .cse6) (<= .cse4 .cse3) .cse7 .cse8)) (let ((.cse10 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (<= .cse4 .cse9) .cse0 .cse1 .cse2 (<= (+ main_~i~0 2) .cse10) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse4) (<= 0 main_~i~0) .cse7 (<= (+ .cse10 2) .cse4) .cse8))))))) [2021-02-23 23:09:39,826 INFO L185 CegarLoopUtils]: At program point L618-4(line 618) the Hoare annotation is: (let ((.cse13 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse11 (+ main_~i~0 2)) (.cse10 (+ |main_#t~post15| 1)) (.cse6 (* 2 main_~len~0)) (.cse12 (+ (select (select |#memory_int| .cse13) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse6 .cse12)) (.cse3 (<= .cse10 main_~len~0)) (.cse4 (not (= .cse13 main_~s~0.base))) (.cse5 (<= .cse11 main_~len~0)) (.cse7 (<= .cse12 .cse6)) (.cse8 (= main_~s~0.offset 0))) (or (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 .cse2) .cse3 .cse4 .cse5 (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse6) .cse7 (<= (+ .cse2 2) .cse6) .cse8)) (let ((.cse9 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse3 .cse4 (<= .cse9 .cse6) .cse5 (<= main_~len~0 .cse10) (<= .cse6 .cse9) (<= main_~len~0 .cse11) .cse7 .cse8)))))) [2021-02-23 23:09:39,826 INFO L185 CegarLoopUtils]: At program point L618-5(lines 618 621) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (+ main_~i~0 2)) (.cse5 (* 2 main_~len~0)) (.cse11 (+ (select (select |#memory_int| .cse12) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse5 .cse11)) (.cse3 (not (= .cse12 main_~s~0.base))) (.cse4 (<= .cse10 main_~len~0)) (.cse6 (<= .cse11 .cse5)) (.cse7 (= main_~s~0.offset 0))) (or (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 .cse2) .cse3 .cse4 (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse5) .cse6 (<= (+ .cse2 2) .cse5) .cse7)) (let ((.cse8 (+ main_~i~0 1))) (and .cse0 .cse3 (<= .cse8 main_~len~0) (<= main_~len~0 .cse8) .cse7)) (let ((.cse9 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse3 (<= .cse9 .cse5) .cse4 (<= .cse5 .cse9) (<= main_~len~0 .cse10) .cse6 .cse7)))))) [2021-02-23 23:09:39,826 INFO L185 CegarLoopUtils]: 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) (<= .cse1 .cse0) (<= (+ .cse2 2) .cse0) (= main_~s~0.offset 0) (<= (+ main_~i~0 3) main_~len~0)))) [2021-02-23 23:09:39,826 INFO L185 CegarLoopUtils]: At program point L631(line 631) the Hoare annotation is: false [2021-02-23 23:09:39,826 INFO L185 CegarLoopUtils]: At program point L623(line 623) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse6 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse6)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse5 (<= main_~len~0 .cse1))) (or (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 (<= (+ .cse2 2) .cse6)) (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse8 (+ main_~i~0 main_~len~0)) (.cse9 (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 (<= main_~len~0 .cse2) (not (= .cse7 main_~s~0.base)) .cse3 .cse4 (<= .cse8 .cse9) (<= (+ .cse2 1) .cse8) .cse5 (<= (+ .cse9 1) .cse6) (= main_~s~0.offset 0))))))) [2021-02-23 23:09:39,827 INFO L185 CegarLoopUtils]: At program point L619(line 619) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse2 (= main_~len~0 2)) (.cse3 (not (= .cse6 main_~s~0.base))) (.cse5 (= main_~s~0.offset 0))) (or (let ((.cse4 (+ main_~i~0 2)) (.cse1 (+ (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1)) (.cse0 (* 2 main_~len~0))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse4 main_~len~0) (<= main_~len~0 .cse4) (<= .cse1 .cse0) .cse5)) (let ((.cse7 (+ main_~i~0 1))) (and .cse2 .cse3 (<= .cse7 main_~len~0) (<= main_~len~0 .cse7) .cse5))))) [2021-02-23 23:09:39,827 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,827 INFO L192 CegarLoopUtils]: At program point L628(line 628) the Hoare annotation is: true [2021-02-23 23:09:39,827 INFO L185 CegarLoopUtils]: At program point L624(line 624) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse6 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse6)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse5 (<= main_~len~0 .cse1))) (or (and .cse0 (<= .cse1 .cse2) (<= .cse2 main_~expected~0) .cse3 .cse4 .cse5 (<= (+ .cse2 2) .cse6) (<= main_~expected~0 .cse2)) (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse9 (+ main_~i~0 main_~len~0)) (.cse8 (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 (<= main_~len~0 .cse2) (not (= .cse7 main_~s~0.base)) (<= .cse8 main_~expected~0) .cse3 .cse4 (<= .cse9 .cse8) (<= main_~expected~0 .cse8) (<= (+ .cse2 1) .cse9) .cse5 (<= (+ .cse8 1) .cse6) (= main_~s~0.offset 0))))))) [2021-02-23 23:09:39,828 INFO L185 CegarLoopUtils]: At program point L624-1(line 624) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse8 (* 2 main_~len~0))) (let ((.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse5 (<= (+ main_~new_data~0 2) .cse8)) (.cse7 (<= main_~expected~0 |main_#t~ret17|)) (.cse6 (<= main_~len~0 .cse1)) (.cse0 (= main_~len~0 2)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (<= .cse1 .cse2) (<= .cse2 main_~expected~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ .cse2 2) .cse8) (<= main_~expected~0 .cse2)) (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse9 (+ main_~i~0 main_~len~0))) (and (<= main_~len~0 .cse2) .cse3 .cse4 .cse5 (<= .cse9 .cse10) .cse7 .cse6 (<= (+ .cse10 1) .cse8) .cse0 (not (= .cse11 main_~s~0.base)) (<= .cse10 main_~expected~0) (<= main_~expected~0 .cse10) (<= (+ .cse2 1) .cse9) (= main_~s~0.offset 0))))))) [2021-02-23 23:09:39,828 INFO L185 CegarLoopUtils]: At program point L624-2(lines 624 626) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse8 (* 2 main_~len~0))) (let ((.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse5 (<= (+ main_~new_data~0 2) .cse8)) (.cse7 (<= main_~expected~0 |main_#t~ret17|)) (.cse6 (<= main_~len~0 .cse1)) (.cse0 (= main_~len~0 2)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (<= .cse1 .cse2) (<= .cse2 main_~expected~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ .cse2 2) .cse8) (<= main_~expected~0 .cse2)) (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse9 (+ main_~i~0 main_~len~0))) (and (<= main_~len~0 .cse2) .cse3 .cse4 .cse5 (<= .cse9 .cse10) .cse7 .cse6 (<= (+ .cse10 1) .cse8) .cse0 (not (= .cse11 main_~s~0.base)) (<= .cse10 main_~expected~0) (<= main_~expected~0 .cse10) (<= (+ .cse2 1) .cse9) (= main_~s~0.offset 0))))))) [2021-02-23 23:09:39,828 INFO L185 CegarLoopUtils]: At program point L624-3(line 624) the Hoare annotation is: false [2021-02-23 23:09:39,828 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 613 632) the Hoare annotation is: true [2021-02-23 23:09:39,828 INFO L185 CegarLoopUtils]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse2 (= main_~len~0 2)) (.cse3 (not (= .cse6 main_~s~0.base))) (.cse0 (* 2 main_~len~0)) (.cse5 (= main_~s~0.offset 0))) (or (let ((.cse4 (+ main_~i~0 2)) (.cse1 (+ (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse4 main_~len~0) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= main_~len~0 .cse4) (<= .cse1 .cse0) .cse5)) (let ((.cse7 (+ main_~i~0 1)) (.cse8 (+ main_~new_data~0 1))) (and .cse2 .cse3 (<= .cse7 main_~len~0) (<= .cse8 .cse0) (<= main_~len~0 .cse7) (<= .cse0 .cse8) .cse5))))) [2021-02-23 23:09:39,829 INFO L185 CegarLoopUtils]: At program point L624-4(line 624) the Hoare annotation is: (let ((.cse8 (+ main_~i~0 2)) (.cse9 (* 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 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse4 (<= (+ main_~new_data~0 2) .cse9)) (.cse6 (<= main_~len~0 .cse8)) (.cse7 (<= main_~expected~0 |main_#t~ret17|))) (or (and .cse0 .cse1 (<= (+ main_~i~0 1) main_~len~0) .cse2 .cse3 .cse4 (<= (+ .cse5 1) (+ main_~i~0 main_~len~0)) .cse6 .cse7) (and .cse0 .cse1 (<= .cse8 main_~len~0) .cse2 .cse3 .cse4 .cse6 .cse7 (<= (+ .cse5 2) .cse9))))) [2021-02-23 23:09:39,829 INFO L185 CegarLoopUtils]: At program point L620-1(lines 618 621) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse9 (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse1 (+ .cse9 1)) (.cse0 (* 2 main_~len~0))) (let ((.cse2 (= main_~len~0 2)) (.cse3 (not (= .cse10 main_~s~0.base))) (.cse6 (<= .cse1 .cse0)) (.cse7 (= main_~s~0.offset 0))) (or (let ((.cse4 (+ main_~i~0 2)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse4 .cse5) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= main_~len~0 .cse4) .cse6 (<= (+ .cse5 2) .cse0) .cse7)) (let ((.cse8 (+ main_~new_data~0 1))) (and .cse2 .cse3 (<= .cse8 .cse0) (<= main_~len~0 (+ main_~i~0 1)) (<= (+ main_~i~0 main_~len~0) .cse9) (<= .cse0 .cse8) .cse6 .cse7))))))) [2021-02-23 23:09:39,829 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,829 INFO L185 CegarLoopUtils]: 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|))) [2021-02-23 23:09:39,829 INFO L185 CegarLoopUtils]: 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)) [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) the Hoare annotation is: false [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: 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)) [2021-02-23 23:09:39,830 INFO L192 CegarLoopUtils]: At program point L577(line 577) the Hoare annotation is: true [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,830 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,831 INFO L185 CegarLoopUtils]: 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)|)) [2021-02-23 23:09:39,831 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 23:09:39,831 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,831 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,831 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,831 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 23:09:39,843 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,844 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,850 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,850 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,853 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,853 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,853 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,855 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,855 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,855 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,855 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,858 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,858 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,858 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,858 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,862 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,862 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,862 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,863 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,863 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,864 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,864 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,864 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,866 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,866 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,866 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,866 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,867 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,867 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,867 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,867 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,871 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,871 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,871 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,871 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,876 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,876 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,880 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:563) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:248) 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:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) 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) [2021-02-23 23:09:39,886 INFO L168 Benchmark]: Toolchain (without parser) took 31467.51 ms. Allocated memory was 152.0 MB in the beginning and 325.1 MB in the end (delta: 173.0 MB). Free memory was 126.4 MB in the beginning and 282.3 MB in the end (delta: -155.9 MB). Peak memory consumption was 190.4 MB. Max. memory is 8.0 GB. [2021-02-23 23:09:39,886 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 152.0 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 23:09:39,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.64 ms. Allocated memory is still 152.0 MB. Free memory was 125.3 MB in the beginning and 102.5 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-02-23 23:09:39,887 INFO L168 Benchmark]: Boogie Preprocessor took 71.95 ms. Allocated memory is still 152.0 MB. Free memory was 102.5 MB in the beginning and 99.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-23 23:09:39,887 INFO L168 Benchmark]: RCFGBuilder took 781.38 ms. Allocated memory is still 152.0 MB. Free memory was 99.7 MB in the beginning and 107.9 MB in the end (delta: -8.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. [2021-02-23 23:09:39,887 INFO L168 Benchmark]: TraceAbstraction took 29962.91 ms. Allocated memory was 152.0 MB in the beginning and 325.1 MB in the end (delta: 173.0 MB). Free memory was 107.4 MB in the beginning and 282.3 MB in the end (delta: -175.0 MB). Peak memory consumption was 170.0 MB. Max. memory is 8.0 GB. [2021-02-23 23:09:39,888 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.25 ms. Allocated memory is still 152.0 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 627.64 ms. Allocated memory is still 152.0 MB. Free memory was 125.3 MB in the beginning and 102.5 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 71.95 ms. Allocated memory is still 152.0 MB. Free memory was 102.5 MB in the beginning and 99.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 781.38 ms. Allocated memory is still 152.0 MB. Free memory was 99.7 MB in the beginning and 107.9 MB in the end (delta: -8.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 29962.91 ms. Allocated memory was 152.0 MB in the beginning and 325.1 MB in the end (delta: 173.0 MB). Free memory was 107.4 MB in the beginning and 282.3 MB in the end (delta: -175.0 MB). Peak memory consumption was 170.0 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$.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$.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.traceabstraction: - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant [2021-02-23 23:09:39,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base 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 [2021-02-23 23:09:39,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,905 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,913 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((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) || ((((len == 2 && !(#memory_$Pointer$[s][4] == s)) && i + 1 <= len) && len <= i + 1) && s == 0)) || ((((((((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) && 2 * len <= new_data + 1) && len <= i + 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && s == 0) - InvariantResult [Line: 622]: Loop Invariant [2021-02-23 23:09:39,916 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,916 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,916 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,916 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,916 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,920 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((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 && len <= unknown-#memory_int-unknown[s][s]) && len <= new_data) && new_data + 2 <= 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && i + 3 <= len)) || (((((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 [2021-02-23 23:09:39,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,926 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,927 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,928 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,928 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base 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 [2021-02-23 23:09:39,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 23:09:39,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 23:09:39,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base 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: 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:563) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...