/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 04:21:41,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 04:21:41,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 04:21:41,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 04:21:41,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 04:21:41,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 04:21:41,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 04:21:41,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 04:21:41,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 04:21:41,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 04:21:41,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 04:21:41,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 04:21:41,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 04:21:41,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 04:21:41,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 04:21:41,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 04:21:41,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 04:21:41,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 04:21:41,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 04:21:41,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 04:21:41,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 04:21:41,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 04:21:41,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 04:21:41,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 04:21:41,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 04:21:41,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 04:21:41,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 04:21:41,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 04:21:41,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 04:21:41,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 04:21:41,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 04:21:42,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 04:21:42,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 04:21:42,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 04:21:42,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 04:21:42,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 04:21:42,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 04:21:42,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 04:21:42,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 04:21:42,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 04:21:42,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 04:21:42,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-24 04:21:42,034 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 04:21:42,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 04:21:42,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 04:21:42,036 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 04:21:42,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 04:21:42,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 04:21:42,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 04:21:42,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 04:21:42,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 04:21:42,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 04:21:42,038 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 04:21:42,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 04:21:42,038 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 04:21:42,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 04:21:42,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 04:21:42,039 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 04:21:42,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 04:21:42,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 04:21:42,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 04:21:42,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 04:21:42,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 04:21:42,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 04:21:42,041 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-24 04:21:42,041 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 [2021-02-24 04:21:42,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 04:21:42,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 04:21:42,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 04:21:42,534 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 04:21:42,535 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 04:21:42,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2021-02-24 04:21:42,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d65b8b0/249da3241b3f4178908ac5b92dfc0096/FLAG73bf7082f [2021-02-24 04:21:43,417 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 04:21:43,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2021-02-24 04:21:43,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d65b8b0/249da3241b3f4178908ac5b92dfc0096/FLAG73bf7082f [2021-02-24 04:21:43,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d65b8b0/249da3241b3f4178908ac5b92dfc0096 [2021-02-24 04:21:43,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 04:21:43,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 04:21:43,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 04:21:43,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 04:21:43,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 04:21:43,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:21:43" (1/1) ... [2021-02-24 04:21:43,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5772d2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:43, skipping insertion in model container [2021-02-24 04:21:43,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:21:43" (1/1) ... [2021-02-24 04:21:43,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 04:21:43,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 04:21:43,917 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2021-02-24 04:21:44,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 04:21:44,155 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 04:21:44,171 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2021-02-24 04:21:44,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 04:21:44,381 INFO L208 MainTranslator]: Completed translation [2021-02-24 04:21:44,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44 WrapperNode [2021-02-24 04:21:44,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 04:21:44,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 04:21:44,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 04:21:44,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 04:21:44,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (1/1) ... [2021-02-24 04:21:44,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 04:21:44,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 04:21:44,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 04:21:44,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 04:21:44,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (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-24 04:21:44,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 04:21:44,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 04:21:44,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 04:21:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2021-02-24 04:21:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-02-24 04:21:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-02-24 04:21:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-02-24 04:21:44,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-02-24 04:21:44,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-02-24 04:21:44,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2021-02-24 04:21:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2021-02-24 04:21:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-02-24 04:21:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-02-24 04:21:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 04:21:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 04:21:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 04:21:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 04:21:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 04:21:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2021-02-24 04:21:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-02-24 04:21:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-02-24 04:21:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-02-24 04:21:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-02-24 04:21:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-02-24 04:21:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-02-24 04:21:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-02-24 04:21:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-02-24 04:21:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-02-24 04:21:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-02-24 04:21:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-02-24 04:21:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-02-24 04:21:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-02-24 04:21:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-02-24 04:21:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-02-24 04:21:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-02-24 04:21:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-02-24 04:21:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-02-24 04:21:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-02-24 04:21:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-02-24 04:21:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-02-24 04:21:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-02-24 04:21:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-02-24 04:21:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-02-24 04:21:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-02-24 04:21:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-02-24 04:21:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-02-24 04:21:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-02-24 04:21:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-02-24 04:21:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-02-24 04:21:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-02-24 04:21:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-02-24 04:21:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-24 04:21:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-02-24 04:21:44,620 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-24 04:21:44,620 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-02-24 04:21:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-02-24 04:21:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-02-24 04:21:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-02-24 04:21:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-02-24 04:21:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-02-24 04:21:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-02-24 04:21:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-02-24 04:21:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-02-24 04:21:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-02-24 04:21:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-02-24 04:21:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-02-24 04:21:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-02-24 04:21:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-02-24 04:21:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-02-24 04:21:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-02-24 04:21:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-02-24 04:21:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-02-24 04:21:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-02-24 04:21:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-02-24 04:21:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-02-24 04:21:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-02-24 04:21:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-02-24 04:21:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-02-24 04:21:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-02-24 04:21:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-02-24 04:21:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-02-24 04:21:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 04:21:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 04:21:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-02-24 04:21:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 04:21:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 04:21:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 04:21:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-02-24 04:21:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-02-24 04:21:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 04:21:45,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 04:21:45,773 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-24 04:21:45,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:21:45 BoogieIcfgContainer [2021-02-24 04:21:45,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 04:21:45,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 04:21:45,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 04:21:45,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 04:21:45,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 04:21:43" (1/3) ... [2021-02-24 04:21:45,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e73ca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:21:45, skipping insertion in model container [2021-02-24 04:21:45,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:21:44" (2/3) ... [2021-02-24 04:21:45,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e73ca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:21:45, skipping insertion in model container [2021-02-24 04:21:45,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:21:45" (3/3) ... [2021-02-24 04:21:45,786 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2021-02-24 04:21:45,794 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 04:21:45,800 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 04:21:45,823 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 04:21:45,854 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 04:21:45,854 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 04:21:45,854 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-24 04:21:45,854 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 04:21:45,855 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 04:21:45,855 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 04:21:45,855 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 04:21:45,855 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 04:21:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2021-02-24 04:21:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-02-24 04:21:45,886 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:45,888 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] [2021-02-24 04:21:45,888 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1772381528, now seen corresponding path program 1 times [2021-02-24 04:21:45,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:45,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1389022749] [2021-02-24 04:21:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:46,019 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:46,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:46,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,198 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:46,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,214 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:46,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,222 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:46,230 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,231 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:46,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,240 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:46,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:46,360 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:46,361 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:46,375 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-24 04:21:46,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1389022749] [2021-02-24 04:21:46,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:46,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-24 04:21:46,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45515784] [2021-02-24 04:21:46,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-24 04:21:46,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:46,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-24 04:21:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-24 04:21:46,421 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 7 states. [2021-02-24 04:21:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:47,232 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2021-02-24 04:21:47,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-02-24 04:21:47,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2021-02-24 04:21:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:47,248 INFO L225 Difference]: With dead ends: 132 [2021-02-24 04:21:47,248 INFO L226 Difference]: Without dead ends: 71 [2021-02-24 04:21:47,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-02-24 04:21:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-02-24 04:21:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2021-02-24 04:21:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-02-24 04:21:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2021-02-24 04:21:47,324 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 26 [2021-02-24 04:21:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:47,324 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2021-02-24 04:21:47,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-24 04:21:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2021-02-24 04:21:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-24 04:21:47,328 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:47,329 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-02-24 04:21:47,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 04:21:47,330 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1109674261, now seen corresponding path program 1 times [2021-02-24 04:21:47,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:47,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608662921] [2021-02-24 04:21:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:47,338 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:47,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,461 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:47,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:47,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:47,585 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:47,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,653 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,654 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-24 04:21:47,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,671 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-24 04:21:47,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:47,708 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,712 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-24 04:21:47,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:47,742 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,743 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:47,750 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:47,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-24 04:21:47,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608662921] [2021-02-24 04:21:47,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:47,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-24 04:21:47,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023077874] [2021-02-24 04:21:47,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-24 04:21:47,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:47,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-24 04:21:47,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-24 04:21:47,767 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 9 states. [2021-02-24 04:21:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:48,138 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2021-02-24 04:21:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-24 04:21:48,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-02-24 04:21:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:48,142 INFO L225 Difference]: With dead ends: 105 [2021-02-24 04:21:48,142 INFO L226 Difference]: Without dead ends: 77 [2021-02-24 04:21:48,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-02-24 04:21:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-02-24 04:21:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2021-02-24 04:21:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-02-24 04:21:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-02-24 04:21:48,167 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 66 [2021-02-24 04:21:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:48,168 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-02-24 04:21:48,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-24 04:21:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-02-24 04:21:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-24 04:21:48,170 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:48,171 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-02-24 04:21:48,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 04:21:48,171 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -499508081, now seen corresponding path program 1 times [2021-02-24 04:21:48,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:48,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283146871] [2021-02-24 04:21:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:48,179 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:48,251 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,252 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,257 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,305 WARN L141 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-02-24 04:21:48,306 WARN L147 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size 8 [2021-02-24 04:21:48,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:48,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:48,392 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,393 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:48,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,394 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,408 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:48,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:48,440 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,441 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,456 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:48,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:48,487 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,489 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,490 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:48,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:48,524 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:48,545 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,546 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:48,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:48,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,579 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,580 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:48,581 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,581 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:48,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:48,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-24 04:21:48,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283146871] [2021-02-24 04:21:48,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:48,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-24 04:21:48,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70370518] [2021-02-24 04:21:48,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-24 04:21:48,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-24 04:21:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-02-24 04:21:48,619 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 17 states. [2021-02-24 04:21:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:50,291 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2021-02-24 04:21:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-24 04:21:50,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2021-02-24 04:21:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:50,295 INFO L225 Difference]: With dead ends: 126 [2021-02-24 04:21:50,295 INFO L226 Difference]: Without dead ends: 121 [2021-02-24 04:21:50,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-02-24 04:21:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-02-24 04:21:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2021-02-24 04:21:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-02-24 04:21:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2021-02-24 04:21:50,333 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 66 [2021-02-24 04:21:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:50,333 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2021-02-24 04:21:50,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-24 04:21:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2021-02-24 04:21:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-24 04:21:50,337 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:50,341 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:21:50,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 04:21:50,342 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash -36617582, now seen corresponding path program 1 times [2021-02-24 04:21:50,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:50,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409403582] [2021-02-24 04:21:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:50,362 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:50,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,400 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:50,410 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,411 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:50,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,423 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:50,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:50,491 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,492 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:50,497 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:50,515 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,515 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,517 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,518 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-24 04:21:50,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,535 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-24 04:21:50,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:50,561 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,562 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:50,563 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:50,564 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-24 04:21:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-02-24 04:21:50,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409403582] [2021-02-24 04:21:50,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:50,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-24 04:21:50,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801080632] [2021-02-24 04:21:50,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-24 04:21:50,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-24 04:21:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-24 04:21:50,592 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 9 states. [2021-02-24 04:21:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:50,966 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2021-02-24 04:21:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-24 04:21:50,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-02-24 04:21:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:50,968 INFO L225 Difference]: With dead ends: 139 [2021-02-24 04:21:50,969 INFO L226 Difference]: Without dead ends: 85 [2021-02-24 04:21:50,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-02-24 04:21:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-02-24 04:21:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-02-24 04:21:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-24 04:21:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2021-02-24 04:21:50,993 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 66 [2021-02-24 04:21:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:50,994 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-02-24 04:21:50,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-24 04:21:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2021-02-24 04:21:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-02-24 04:21:50,996 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:50,996 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] [2021-02-24 04:21:50,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 04:21:50,996 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1317118349, now seen corresponding path program 1 times [2021-02-24 04:21:50,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:50,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555645993] [2021-02-24 04:21:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:51,002 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,065 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,066 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,067 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,090 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,091 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,108 WARN L141 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-02-24 04:21:51,116 WARN L147 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size 12 [2021-02-24 04:21:51,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:51,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:51,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,227 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:51,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:51,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:51,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,292 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:51,308 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,309 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:51,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,336 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:51,336 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,337 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:51,352 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,352 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:51,370 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:51,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,399 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,400 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:51,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,405 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:51,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-24 04:21:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:51,437 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:51,438 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-24 04:21:51,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555645993] [2021-02-24 04:21:51,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:51,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-02-24 04:21:51,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839890803] [2021-02-24 04:21:51,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-02-24 04:21:51,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-02-24 04:21:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-02-24 04:21:51,476 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 18 states. [2021-02-24 04:21:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:52,678 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-02-24 04:21:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-24 04:21:52,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2021-02-24 04:21:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:52,691 INFO L225 Difference]: With dead ends: 94 [2021-02-24 04:21:52,691 INFO L226 Difference]: Without dead ends: 91 [2021-02-24 04:21:52,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2021-02-24 04:21:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-02-24 04:21:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2021-02-24 04:21:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-24 04:21:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-02-24 04:21:52,757 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 75 [2021-02-24 04:21:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:52,758 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-02-24 04:21:52,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-02-24 04:21:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-02-24 04:21:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-02-24 04:21:52,764 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:52,764 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] [2021-02-24 04:21:52,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 04:21:52,764 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1546910366, now seen corresponding path program 1 times [2021-02-24 04:21:52,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:52,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814959523] [2021-02-24 04:21:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:52,776 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:52,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:52,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:52,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:52,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:52,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:52,886 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,887 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:52,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:52,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,906 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:21:52,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:52,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:52,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:52,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:52,998 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:52,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:53,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:53,044 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:53,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,046 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:53,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:53,113 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:53,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:53,144 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,144 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,145 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,165 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:53,187 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,188 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:53,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-24 04:21:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:53,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,257 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,280 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:53,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-24 04:21:53,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814959523] [2021-02-24 04:21:53,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:53,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-02-24 04:21:53,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428945248] [2021-02-24 04:21:53,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-02-24 04:21:53,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-02-24 04:21:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2021-02-24 04:21:53,318 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2021-02-24 04:21:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:55,110 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-02-24 04:21:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-24 04:21:55,111 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2021-02-24 04:21:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:55,117 INFO L225 Difference]: With dead ends: 98 [2021-02-24 04:21:55,117 INFO L226 Difference]: Without dead ends: 90 [2021-02-24 04:21:55,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2021-02-24 04:21:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-02-24 04:21:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-02-24 04:21:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-02-24 04:21:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-02-24 04:21:55,170 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 76 [2021-02-24 04:21:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:55,171 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-02-24 04:21:55,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-02-24 04:21:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-02-24 04:21:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-02-24 04:21:55,177 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:55,178 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-02-24 04:21:55,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 04:21:55,178 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1420644118, now seen corresponding path program 1 times [2021-02-24 04:21:55,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:55,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [305806814] [2021-02-24 04:21:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:55,184 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:55,272 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,278 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,283 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,284 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,291 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,307 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,314 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,315 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,324 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,325 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:21:55,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,336 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:55,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,404 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,405 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:55,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,431 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,432 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:55,432 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,447 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,448 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:55,473 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,473 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,501 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,519 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,520 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,575 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,596 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,596 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,618 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,619 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:21:55,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-24 04:21:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:55,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-02-24 04:21:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,689 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 04:21:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:55,743 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:55,744 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-24 04:21:55,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [305806814] [2021-02-24 04:21:55,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:55,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-02-24 04:21:55,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794340124] [2021-02-24 04:21:55,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-02-24 04:21:55,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:55,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-02-24 04:21:55,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2021-02-24 04:21:55,782 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 24 states. [2021-02-24 04:21:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:21:57,392 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2021-02-24 04:21:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-24 04:21:57,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2021-02-24 04:21:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:21:57,394 INFO L225 Difference]: With dead ends: 94 [2021-02-24 04:21:57,394 INFO L226 Difference]: Without dead ends: 87 [2021-02-24 04:21:57,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2021-02-24 04:21:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-02-24 04:21:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-02-24 04:21:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-02-24 04:21:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2021-02-24 04:21:57,420 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 90 [2021-02-24 04:21:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:21:57,421 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2021-02-24 04:21:57,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-02-24 04:21:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2021-02-24 04:21:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-02-24 04:21:57,423 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:21:57,423 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-02-24 04:21:57,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 04:21:57,423 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:21:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:21:57,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1561940976, now seen corresponding path program 2 times [2021-02-24 04:21:57,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:21:57,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452256220] [2021-02-24 04:21:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:21:57,429 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:21:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:57,516 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,516 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:57,525 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:21:57,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-24 04:21:57,549 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,550 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-24 04:21:57,551 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,552 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,566 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,567 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,583 WARN L141 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-02-24 04:21:57,584 WARN L147 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size 21 [2021-02-24 04:21:57,608 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,608 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:57,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:21:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,668 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:21:57,670 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:21:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,698 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,714 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,746 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,747 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,764 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:21:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:21:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,845 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,846 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,847 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,847 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,849 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 04:21:57,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-24 04:21:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,906 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,928 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-24 04:21:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,954 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:21:57,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 04:21:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:21:57,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:57,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-24 04:21:58,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:21:58,018 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:21:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-24 04:21:58,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1452256220] [2021-02-24 04:21:58,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:21:58,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-02-24 04:21:58,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057546732] [2021-02-24 04:21:58,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-02-24 04:21:58,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:21:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-02-24 04:21:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-02-24 04:21:58,067 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 24 states. [2021-02-24 04:21:59,855 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-02-24 04:22:00,164 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-02-24 04:22:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:22:00,318 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-02-24 04:22:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-02-24 04:22:00,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2021-02-24 04:22:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:22:00,321 INFO L225 Difference]: With dead ends: 111 [2021-02-24 04:22:00,321 INFO L226 Difference]: Without dead ends: 102 [2021-02-24 04:22:00,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2021-02-24 04:22:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-02-24 04:22:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2021-02-24 04:22:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-02-24 04:22:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2021-02-24 04:22:00,347 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 90 [2021-02-24 04:22:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:22:00,348 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2021-02-24 04:22:00,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-02-24 04:22:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2021-02-24 04:22:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-02-24 04:22:00,350 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:22:00,350 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-02-24 04:22:00,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 04:22:00,350 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:22:00,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:22:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 176174744, now seen corresponding path program 1 times [2021-02-24 04:22:00,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:22:00,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744709987] [2021-02-24 04:22:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:22:00,356 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:22:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,395 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,396 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,399 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,400 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,401 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,408 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,414 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,421 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,422 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:22:00,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:22:00,446 WARN L141 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-02-24 04:22:00,447 WARN L147 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size 8 [2021-02-24 04:22:00,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,460 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:22:00,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:22:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,521 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:22:00,522 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,523 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-24 04:22:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,546 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,547 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,561 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,562 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:22:00,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:22:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,585 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,585 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,599 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,600 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:22:00,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-24 04:22:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,612 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,614 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,615 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:22:00,631 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,631 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:22:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-24 04:22:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:22:00,660 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 04:22:00,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-24 04:22:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:22:00,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-02-24 04:22:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,724 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:22:00,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 04:22:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:22:00,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,730 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:22:00,731 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:22:00,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:22:00,787 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-24 04:22:00,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744709987] [2021-02-24 04:22:00,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:22:00,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-02-24 04:22:00,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396172181] [2021-02-24 04:22:00,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-02-24 04:22:00,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:22:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-02-24 04:22:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-02-24 04:22:00,790 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 19 states. [2021-02-24 04:22:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:22:02,198 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2021-02-24 04:22:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-24 04:22:02,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2021-02-24 04:22:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:22:02,200 INFO L225 Difference]: With dead ends: 105 [2021-02-24 04:22:02,200 INFO L226 Difference]: Without dead ends: 0 [2021-02-24 04:22:02,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2021-02-24 04:22:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-24 04:22:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-24 04:22:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-24 04:22:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-24 04:22:02,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2021-02-24 04:22:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:22:02,203 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-24 04:22:02,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-02-24 04:22:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-24 04:22:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-24 04:22:02,204 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-24 04:22:02,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-24 04:22:03,490 WARN L202 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-02-24 04:22:03,800 WARN L202 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-02-24 04:22:04,120 WARN L202 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2021-02-24 04:22:04,475 WARN L202 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-24 04:22:04,679 WARN L202 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-24 04:22:05,088 WARN L202 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-24 04:22:05,400 WARN L202 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-02-24 04:22:05,679 WARN L202 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-02-24 04:22:05,988 WARN L202 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2021-02-24 04:22:06,518 WARN L202 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2021-02-24 04:22:06,722 WARN L202 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2021-02-24 04:22:06,910 WARN L202 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2021-02-24 04:22:07,155 WARN L202 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-24 04:22:07,347 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-24 04:22:07,593 WARN L202 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-24 04:22:07,945 WARN L202 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-02-24 04:22:08,183 WARN L202 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-02-24 04:22:08,327 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-24 04:22:08,470 WARN L202 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-24 04:22:08,884 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-02-24 04:22:09,237 WARN L202 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2021-02-24 04:22:09,567 WARN L202 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-02-24 04:22:09,855 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2021-02-24 04:22:10,158 WARN L202 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-24 04:22:10,408 WARN L202 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-02-24 04:22:10,506 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-24 04:22:10,506 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-24 04:22:10,506 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point __bswap_32ENTRY(lines 166 170) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point L169(line 169) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point L169-1(line 169) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point __bswap_32FINAL(lines 166 170) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point __bswap_32EXIT(lines 166 170) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point __uint64_identityFINAL(lines 186 190) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point __uint64_identityENTRY(lines 186 190) no Hoare annotation was computed. [2021-02-24 04:22:10,507 INFO L189 CegarLoopUtils]: For program point __uint64_identityEXIT(lines 186 190) no Hoare annotation was computed. [2021-02-24 04:22:10,508 INFO L192 CegarLoopUtils]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2021-02-24 04:22:10,508 INFO L192 CegarLoopUtils]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2021-02-24 04:22:10,508 INFO L192 CegarLoopUtils]: At program point L6(line 6) the Hoare annotation is: true [2021-02-24 04:22:10,508 INFO L192 CegarLoopUtils]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2021-02-24 04:22:10,508 INFO L192 CegarLoopUtils]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2021-02-24 04:22:10,508 INFO L189 CegarLoopUtils]: For program point __bswap_64ENTRY(lines 171 175) no Hoare annotation was computed. [2021-02-24 04:22:10,508 INFO L189 CegarLoopUtils]: For program point L174(line 174) no Hoare annotation was computed. [2021-02-24 04:22:10,508 INFO L189 CegarLoopUtils]: For program point L174-1(line 174) no Hoare annotation was computed. [2021-02-24 04:22:10,508 INFO L189 CegarLoopUtils]: For program point __bswap_64FINAL(lines 171 175) no Hoare annotation was computed. [2021-02-24 04:22:10,508 INFO L189 CegarLoopUtils]: For program point __bswap_64EXIT(lines 171 175) no Hoare annotation was computed. [2021-02-24 04:22:10,509 INFO L185 CegarLoopUtils]: At program point L547-2(line 547) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret13.offset|) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= |main_#t~ret13.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (and (= main_~dev1~0.base 0) (= |main_#t~ret13.offset| 0) (= main_~dev1~0.offset 0) (= |main_#t~ret13.base| 0)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-24 04:22:10,509 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 545 556) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-24 04:22:10,509 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 545 556) the Hoare annotation is: true [2021-02-24 04:22:10,509 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 545 556) the Hoare annotation is: true [2021-02-24 04:22:10,509 INFO L185 CegarLoopUtils]: At program point L552(line 552) the Hoare annotation is: (let ((.cse1 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse0 (<= 2 main_~dev2~0.offset)) (.cse2 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (and .cse1 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) .cse2) (and .cse1 (<= main_~dev2~0.offset 2) (not (= 2 ~elem~0.offset)) .cse0 (= main_~dev2~0.base ~elem~0.base) .cse2) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-24 04:22:10,509 INFO L185 CegarLoopUtils]: At program point L551(line 551) the Hoare annotation is: (let ((.cse0 (<= 2 main_~dev2~0.offset)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (let ((.cse2 (<= main_~dev2~0.offset 2)) (.cse3 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse2 .cse0 (= main_~dev2~0.base ~elem~0.base) .cse3) (and .cse2 .cse0 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) .cse3))) .cse1))) [2021-02-24 04:22:10,510 INFO L185 CegarLoopUtils]: At program point L550(line 550) the Hoare annotation is: (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-24 04:22:10,510 INFO L185 CegarLoopUtils]: At program point L549(lines 549 554) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset))) (or (and (= main_~dev2~0.offset 0) (= ~elem~0.offset 0) (= main_~dev2~0.base 0) .cse0) (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse0) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-24 04:22:10,510 INFO L185 CegarLoopUtils]: At program point L550-1(line 550) the Hoare annotation is: (let ((.cse1 (+ main_~dev1~0.offset 1))) (let ((.cse0 (<= main_~dev2~0.offset 2)) (.cse2 (<= .cse1 main_~dev2~0.offset)) (.cse3 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (<= 2 main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) (<= .cse1 ~elem~0.offset) .cse2 .cse3) (and .cse0 (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse2 .cse3) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-24 04:22:10,510 INFO L185 CegarLoopUtils]: At program point L548(line 548) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-24 04:22:10,511 INFO L192 CegarLoopUtils]: At program point L549-1(lines 549 554) the Hoare annotation is: true [2021-02-24 04:22:10,511 INFO L185 CegarLoopUtils]: At program point L547(line 547) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-24 04:22:10,511 INFO L185 CegarLoopUtils]: At program point L548-1(line 548) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset))) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (<= (+ main_~dev1~0.offset 1) |main_#t~ret14.offset|) (<= 1 main_~dev1~0.offset) (<= |main_#t~ret14.offset| 2) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse0) (and (= |main_#t~ret14.offset| 0) (= |main_#t~ret14.base| 0) (= ~elem~0.offset 0) .cse0) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-24 04:22:10,511 INFO L185 CegarLoopUtils]: At program point L546(line 546) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-24 04:22:10,511 INFO L185 CegarLoopUtils]: At program point L547-1(line 547) the Hoare annotation is: (or (and (= |main_#t~ret13.offset| 0) (= |main_#t~ret13.base| 0)) (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret13.offset|) (<= |main_#t~ret13.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-24 04:22:10,512 INFO L185 CegarLoopUtils]: At program point L548-2(line 548) the Hoare annotation is: (let ((.cse0 (= ~elem~0.offset 0)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) .cse0 (<= |main_#t~ret14.offset| 2) (= |old(~elem~0.base)| ~elem~0.base) (<= 2 |main_#t~ret14.offset|) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse1) (and (= |main_#t~ret14.offset| 0) (= main_~dev2~0.offset 0) (= |main_#t~ret14.base| 0) .cse0 (= main_~dev2~0.base 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-24 04:22:10,512 INFO L185 CegarLoopUtils]: At program point __getMemoryENTRY(lines 520 527) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,512 INFO L185 CegarLoopUtils]: At program point __getMemoryEXIT(lines 520 527) the Hoare annotation is: (let ((.cse3 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (<= .cse3 ~guard_malloc_counter~0.offset)) (.cse1 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= |__getMemory_#res.offset| 0) .cse0 (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (let ((.cse2 (not (= |__getMemory_#in~size| 8)))) (and (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= ~guard_malloc_counter~0.offset .cse3) .cse0 (<= .cse3 |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| .cse3)) (not (= ~elem~0.offset 0))))) [2021-02-24 04:22:10,512 INFO L185 CegarLoopUtils]: At program point __getMemoryFINAL(lines 520 527) the Hoare annotation is: (let ((.cse3 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (<= .cse3 ~guard_malloc_counter~0.offset)) (.cse1 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= |__getMemory_#res.offset| 0) .cse0 (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (let ((.cse2 (not (= |__getMemory_#in~size| 8)))) (and (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= ~guard_malloc_counter~0.offset .cse3) .cse0 (<= .cse3 |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| .cse3)) (not (= ~elem~0.offset 0))))) [2021-02-24 04:22:10,513 INFO L185 CegarLoopUtils]: At program point L526(line 526) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,513 INFO L185 CegarLoopUtils]: At program point L525(line 525) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2021-02-24 04:22:10,513 INFO L185 CegarLoopUtils]: At program point L524(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,513 INFO L185 CegarLoopUtils]: At program point L523(line 523) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |__getMemory_#t~post9.offset| |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,513 INFO L185 CegarLoopUtils]: At program point L524-1(lines 524 525) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,513 INFO L185 CegarLoopUtils]: At program point L522(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,514 INFO L185 CegarLoopUtils]: At program point L523-1(line 523) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (= |__getMemory_#t~post9.offset| |old(~guard_malloc_counter~0.offset)|) (<= ~guard_malloc_counter~0.offset .cse1) (<= .cse1 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,514 INFO L185 CegarLoopUtils]: At program point L524-2(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2021-02-24 04:22:10,514 INFO L185 CegarLoopUtils]: At program point L524-3(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,514 INFO L185 CegarLoopUtils]: At program point L522-2(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,514 INFO L185 CegarLoopUtils]: At program point L522-3(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-24 04:22:10,514 INFO L189 CegarLoopUtils]: For program point __uint32_identityFINAL(lines 181 185) no Hoare annotation was computed. [2021-02-24 04:22:10,514 INFO L189 CegarLoopUtils]: For program point __uint32_identityENTRY(lines 181 185) no Hoare annotation was computed. [2021-02-24 04:22:10,515 INFO L189 CegarLoopUtils]: For program point L184(line 184) no Hoare annotation was computed. [2021-02-24 04:22:10,515 INFO L189 CegarLoopUtils]: For program point __uint32_identityEXIT(lines 181 185) no Hoare annotation was computed. [2021-02-24 04:22:10,515 INFO L185 CegarLoopUtils]: At program point L529(line 529) the Hoare annotation is: (or (not (= |my_malloc_#in~size| 8)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= my_malloc_~size 8))) [2021-02-24 04:22:10,515 INFO L185 CegarLoopUtils]: At program point my_mallocFINAL(lines 528 530) the Hoare annotation is: (let ((.cse8 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse11 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse4 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse10 (not (= |my_malloc_#in~size| 8)))) (let ((.cse0 (<= 0 |my_malloc_#res.base|)) (.cse1 (<= |my_malloc_#res.base| 0)) (.cse2 (<= 0 |my_malloc_#res.offset|)) (.cse3 (<= |my_malloc_#res.offset| 0)) (.cse5 (and (or .cse11 .cse10) (or .cse4 .cse10))) (.cse9 (not (= ~elem~0.offset 0))) (.cse6 (<= ~guard_malloc_counter~0.offset .cse8)) (.cse7 (<= .cse8 |my_malloc_#res.offset|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (and .cse6 .cse7 (<= |my_malloc_#res.offset| .cse8) (<= 1 ~guard_malloc_counter~0.offset)) .cse9) (or .cse10 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse11 (and (<= .cse8 ~guard_malloc_counter~0.offset) .cse0 .cse1 .cse2 .cse3) .cse5 .cse9 (and .cse6 (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse7))))) [2021-02-24 04:22:10,515 INFO L185 CegarLoopUtils]: At program point L529-1(line 529) the Hoare annotation is: (let ((.cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse10 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse9 (not (= |my_malloc_#in~size| 8))) (.cse4 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (and (<= ~guard_malloc_counter~0.offset .cse4) (<= |my_malloc_#t~ret11.offset| ~guard_malloc_counter~0.offset) (<= .cse4 |my_malloc_#t~ret11.offset|))) (.cse2 (and (or .cse1 .cse9) (or .cse10 .cse9))) (.cse5 (<= 0 |my_malloc_#t~ret11.offset|)) (.cse6 (<= |my_malloc_#t~ret11.offset| 0)) (.cse7 (<= |my_malloc_#t~ret11.base| 0)) (.cse8 (<= 0 |my_malloc_#t~ret11.base|)) (.cse3 (not (= ~elem~0.offset 0)))) (and (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse0 .cse1 .cse2 .cse3 (and (<= .cse4 ~guard_malloc_counter~0.offset) .cse5 .cse6 .cse7 .cse8)) (or .cse9 (= my_malloc_~size 8)) (or .cse0 .cse10 .cse2 (and .cse5 .cse6 .cse7 .cse8) .cse3)))) [2021-02-24 04:22:10,516 INFO L185 CegarLoopUtils]: At program point L529-2(line 529) the Hoare annotation is: (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse10 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse14 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse0 (not (= |my_malloc_#in~size| 8)))) (let ((.cse2 (<= 0 |my_malloc_#t~ret11.offset|)) (.cse3 (<= 0 |my_malloc_#res.base|)) (.cse4 (<= |my_malloc_#res.base| 0)) (.cse5 (<= 0 |my_malloc_#res.offset|)) (.cse6 (<= |my_malloc_#t~ret11.offset| 0)) (.cse7 (<= |my_malloc_#t~ret11.base| 0)) (.cse8 (<= |my_malloc_#res.offset| 0)) (.cse9 (<= 0 |my_malloc_#t~ret11.base|)) (.cse11 (and (or .cse10 .cse0) (or .cse14 .cse0))) (.cse12 (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#t~ret11.offset| ~guard_malloc_counter~0.offset) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|) (<= .cse1 |my_malloc_#t~ret11.offset|))) (.cse13 (not (= ~elem~0.offset 0)))) (and (or .cse0 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= .cse1 ~guard_malloc_counter~0.offset) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse14 .cse11 .cse12 .cse13)))) [2021-02-24 04:22:10,516 INFO L185 CegarLoopUtils]: At program point my_mallocENTRY(lines 528 530) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (not (= |my_malloc_#in~size| 8))) [2021-02-24 04:22:10,516 INFO L185 CegarLoopUtils]: At program point my_mallocEXIT(lines 528 530) the Hoare annotation is: (let ((.cse8 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse11 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse4 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse10 (not (= |my_malloc_#in~size| 8)))) (let ((.cse0 (<= 0 |my_malloc_#res.base|)) (.cse1 (<= |my_malloc_#res.base| 0)) (.cse2 (<= 0 |my_malloc_#res.offset|)) (.cse3 (<= |my_malloc_#res.offset| 0)) (.cse5 (and (or .cse11 .cse10) (or .cse4 .cse10))) (.cse9 (not (= ~elem~0.offset 0))) (.cse6 (<= ~guard_malloc_counter~0.offset .cse8)) (.cse7 (<= .cse8 |my_malloc_#res.offset|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (and .cse6 .cse7 (<= |my_malloc_#res.offset| .cse8) (<= 1 ~guard_malloc_counter~0.offset)) .cse9) (or .cse10 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse11 (and (<= .cse8 ~guard_malloc_counter~0.offset) .cse0 .cse1 .cse2 .cse3) .cse5 .cse9 (and .cse6 (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse7))))) [2021-02-24 04:22:10,516 INFO L185 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,516 INFO L185 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,516 INFO L185 CegarLoopUtils]: At program point L544(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L544-1(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L544-2(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,517 INFO L185 CegarLoopUtils]: At program point L534(line 534) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point L542(line 542) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point L541(lines 541 542) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point L541-2(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-24 04:22:10,518 INFO L185 CegarLoopUtils]: At program point list_delEXIT(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-24 04:22:10,519 INFO L185 CegarLoopUtils]: At program point list_delENTRY(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-24 04:22:10,519 INFO L185 CegarLoopUtils]: At program point list_addENTRY(lines 535 539) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse0) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0))) [2021-02-24 04:22:10,519 INFO L185 CegarLoopUtils]: At program point L538(line 538) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-24 04:22:10,519 INFO L185 CegarLoopUtils]: At program point L537(lines 537 538) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-24 04:22:10,520 INFO L185 CegarLoopUtils]: At program point L536(line 536) the Hoare annotation is: (let ((.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse1 .cse3 .cse2)) (or .cse4 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse2)) (or .cse4 .cse0 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-24 04:22:10,520 INFO L185 CegarLoopUtils]: At program point L537-1(line 537) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-24 04:22:10,520 INFO L185 CegarLoopUtils]: At program point L535(lines 535 539) the Hoare annotation is: (let ((.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse1 .cse3 .cse2)) (or .cse4 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse2)) (or .cse4 .cse0 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-24 04:22:10,520 INFO L185 CegarLoopUtils]: At program point L536-2(line 536) the Hoare annotation is: (and (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|))) (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (not (<= |list_add_#in~new.offset| 2)))) [2021-02-24 04:22:10,520 INFO L185 CegarLoopUtils]: At program point L537-3(line 537) the Hoare annotation is: (let ((.cse5 (= |old(~elem~0.base)| ~elem~0.base)) (.cse6 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse3 (= list_add_~new.base |list_add_#in~new.base|)) (.cse4 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (not (<= 2 |list_add_#in~new.offset|))) (.cse1 (and .cse5 .cse6))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) .cse0 .cse1 (not (<= |list_add_#in~new.offset| 2))) (or .cse2 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse3 .cse4 .cse5 .cse6)) (or .cse2 (and .cse3 .cse4) .cse0 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse1)))) [2021-02-24 04:22:10,521 INFO L185 CegarLoopUtils]: At program point L536-3(line 536) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-24 04:22:10,521 INFO L185 CegarLoopUtils]: At program point L537-4(lines 535 539) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2021-02-24 04:22:10,521 INFO L185 CegarLoopUtils]: At program point list_addEXIT(lines 535 539) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2021-02-24 04:22:10,521 INFO L189 CegarLoopUtils]: For program point __uint16_identityENTRY(lines 176 180) no Hoare annotation was computed. [2021-02-24 04:22:10,521 INFO L189 CegarLoopUtils]: For program point __uint16_identityEXIT(lines 176 180) no Hoare annotation was computed. [2021-02-24 04:22:10,521 INFO L189 CegarLoopUtils]: For program point __uint16_identityFINAL(lines 176 180) no Hoare annotation was computed. [2021-02-24 04:22:10,522 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-02-24 04:22:10,522 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-24 04:22:10,522 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-24 04:22:10,522 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-24 04:22:10,522 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-24 04:22:10,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 04:22:10 BoogieIcfgContainer [2021-02-24 04:22:10,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 04:22:10,551 INFO L168 Benchmark]: Toolchain (without parser) took 26866.18 ms. Allocated memory was 153.1 MB in the beginning and 431.0 MB in the end (delta: 277.9 MB). Free memory was 135.7 MB in the beginning and 231.6 MB in the end (delta: -95.9 MB). Peak memory consumption was 264.2 MB. Max. memory is 8.0 GB. [2021-02-24 04:22:10,552 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 153.1 MB. Free memory was 128.4 MB in the beginning and 128.4 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 04:22:10,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.34 ms. Allocated memory is still 153.1 MB. Free memory was 134.5 MB in the beginning and 125.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-02-24 04:22:10,553 INFO L168 Benchmark]: Boogie Preprocessor took 110.48 ms. Allocated memory is still 153.1 MB. Free memory was 125.7 MB in the beginning and 123.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 04:22:10,553 INFO L168 Benchmark]: RCFGBuilder took 1280.99 ms. Allocated memory is still 153.1 MB. Free memory was 123.1 MB in the beginning and 120.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2021-02-24 04:22:10,553 INFO L168 Benchmark]: TraceAbstraction took 24772.95 ms. Allocated memory was 153.1 MB in the beginning and 431.0 MB in the end (delta: 277.9 MB). Free memory was 120.3 MB in the beginning and 231.6 MB in the end (delta: -111.2 MB). Peak memory consumption was 249.1 MB. Max. memory is 8.0 GB. [2021-02-24 04:22:10,555 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.29 ms. Allocated memory is still 153.1 MB. Free memory was 128.4 MB in the beginning and 128.4 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 683.34 ms. Allocated memory is still 153.1 MB. Free memory was 134.5 MB in the beginning and 125.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 110.48 ms. Allocated memory is still 153.1 MB. Free memory was 125.7 MB in the beginning and 123.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1280.99 ms. Allocated memory is still 153.1 MB. Free memory was 123.1 MB in the beginning and 120.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24772.95 ms. Allocated memory was 153.1 MB in the beginning and 431.0 MB in the end (delta: 277.9 MB). Free memory was 120.3 MB in the beginning and 231.6 MB in the end (delta: -111.2 MB). Peak memory consumption was 249.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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 - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 545]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 520]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: (((!(\old(guard_malloc_counter) <= 1) || (((((\result <= 0 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result)) || ((!(\old(size) == 8) || !(1 <= \old(guard_malloc_counter))) && (!(\old(size) == 8) || !(\old(guard_malloc_counter) == 0)))) || ((((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result) && 8 == size) && \result <= \old(guard_malloc_counter) + 1)) || !(elem == 0) - ProcedureContractResult [Line: 528]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: ((((((((0 <= \result && \result <= 0) && 0 <= \result) && \result <= 0) || !(\old(guard_malloc_counter) == 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || (((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= \result) && \result <= \old(guard_malloc_counter) + 1) && 1 <= guard_malloc_counter)) || !(elem == 0)) && (!(\old(size) == 8) || size == 8)) && (((((!(\old(guard_malloc_counter) <= 1) || !(1 <= \old(guard_malloc_counter))) || ((((\old(guard_malloc_counter) + 1 <= guard_malloc_counter && 0 <= \result) && \result <= 0) && 0 <= \result) && \result <= 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || !(elem == 0)) || ((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \result <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result)) - ProcedureContractResult [Line: 540]: Procedure Contract for list_del Derived contract for procedure list_del: (!(1 <= guard_malloc_counter) || elem == 0) || (\old(elem) == elem && \old(elem) == elem) - ProcedureContractResult [Line: 535]: Procedure Contract for list_add Derived contract for procedure list_add: (((((!(1 <= guard_malloc_counter) || !(1 <= new)) || !(\old(elem) == 0)) || (elem == 0 && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter)) && (((!(1 <= guard_malloc_counter) || !(new + 1 <= \old(elem))) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter))) && ((((new == new && new == new) || !(1 <= guard_malloc_counter)) || !(2 <= new)) || !(\old(elem) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.3s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 568 SDtfs, 908 SDslu, 2569 SDs, 0 SdLazy, 5942 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 379 PreInvPairs, 637 NumberOfFragments, 2907 HoareAnnotationTreeSize, 379 FomulaSimplifications, 27510 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 76 FomulaSimplificationsInter, 8318 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...