/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:23:51,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:23:51,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:23:51,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:23:51,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:23:51,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:23:51,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:23:51,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:23:51,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:23:51,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:23:51,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:23:51,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:23:51,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:23:51,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:23:51,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:23:51,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:23:51,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:23:51,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:23:51,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:23:51,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:23:51,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:23:51,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:23:51,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:23:51,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:23:51,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:23:51,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:23:51,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:23:51,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:23:51,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:23:51,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:23:51,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:23:51,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:23:51,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:23:51,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:23:51,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:23:51,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:23:51,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:23:51,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:23:51,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:23:51,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:23:51,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:23:51,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:23:51,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:23:51,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:23:51,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:23:51,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:23:51,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:23:51,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:23:51,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:23:51,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:23:51,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:23:51,921 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:23:51,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:23:51,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:23:51,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:23:51,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:23:51,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:23:51,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:51,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:23:51,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:23:51,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:23:51,922 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:23:51,922 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 23:23:52,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:23:52,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:23:52,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:23:52,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:23:52,139 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:23:52,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-01-31 23:23:52,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9047cb889/d4a82a59ce2c40b1bfdfe0379f4ab8d1/FLAG0b390cf19 [2022-01-31 23:23:52,594 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:23:52,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-01-31 23:23:52,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9047cb889/d4a82a59ce2c40b1bfdfe0379f4ab8d1/FLAG0b390cf19 [2022-01-31 23:23:52,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9047cb889/d4a82a59ce2c40b1bfdfe0379f4ab8d1 [2022-01-31 23:23:52,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:23:52,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:23:52,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:52,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:23:52,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:23:52,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486ddaf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52, skipping insertion in model container [2022-01-31 23:23:52,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:23:52,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:23:52,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-01-31 23:23:52,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-01-31 23:23:52,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-01-31 23:23:52,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-01-31 23:23:52,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-01-31 23:23:52,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-01-31 23:23:52,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-01-31 23:23:52,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-01-31 23:23:52,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-01-31 23:23:52,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-01-31 23:23:52,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-01-31 23:23:52,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-01-31 23:23:52,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-01-31 23:23:52,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-01-31 23:23:52,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-01-31 23:23:52,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-01-31 23:23:52,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-01-31 23:23:52,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:52,848 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:23:52,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-01-31 23:23:52,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-01-31 23:23:52,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-01-31 23:23:52,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-01-31 23:23:52,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-01-31 23:23:52,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-01-31 23:23:52,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-01-31 23:23:52,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-01-31 23:23:52,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-01-31 23:23:52,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-01-31 23:23:52,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-01-31 23:23:52,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-01-31 23:23:52,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-01-31 23:23:52,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-01-31 23:23:52,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-01-31 23:23:52,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-01-31 23:23:52,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-01-31 23:23:52,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:52,890 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:23:52,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52 WrapperNode [2022-01-31 23:23:52,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:52,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:23:52,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:23:52,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:23:52,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:23:52,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:23:52,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:23:52,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:23:52,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (1/1) ... [2022-01-31 23:23:52,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:23:52,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 23:23:52,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 23:23:52,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:23:52,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:23:52,985 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:23:52,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:23:52,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:23:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:23:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:23:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:23:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:23:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:23:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:23:53,045 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:23:53,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:23:53,238 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:23:53,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:23:53,244 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 23:23:53,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:53 BoogieIcfgContainer [2022-01-31 23:23:53,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:23:53,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:23:53,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:23:53,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:23:53,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:23:52" (1/3) ... [2022-01-31 23:23:53,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ec05a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:53, skipping insertion in model container [2022-01-31 23:23:53,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:52" (2/3) ... [2022-01-31 23:23:53,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ec05a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:53, skipping insertion in model container [2022-01-31 23:23:53,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:53" (3/3) ... [2022-01-31 23:23:53,259 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-01-31 23:23:53,263 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:23:53,263 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-01-31 23:23:53,311 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:23:53,316 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-01-31 23:23:53,316 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-01-31 23:23:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:23:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 23:23:53,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,339 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2022-01-31 23:23:53,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279087367] [2022-01-31 23:23:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,398 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,548 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279087367] [2022-01-31 23:23:53,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1279087367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:53,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166312774] [2022-01-31 23:23:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:53,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:53,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:53,595 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:53,865 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-01-31 23:23:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 23:23:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:53,878 INFO L225 Difference]: With dead ends: 87 [2022-01-31 23:23:53,878 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 23:23:53,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:53,891 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:53,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 23:23:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-01-31 23:23:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-01-31 23:23:53,951 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-01-31 23:23:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:53,951 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-01-31 23:23:53,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-01-31 23:23:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 23:23:53,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:23:53,954 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2022-01-31 23:23:53,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584727300] [2022-01-31 23:23:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,965 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,076 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584727300] [2022-01-31 23:23:54,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [584727300] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:54,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051107175] [2022-01-31 23:23:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:54,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:54,084 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,347 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-01-31 23:23:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:54,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 23:23:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,351 INFO L225 Difference]: With dead ends: 111 [2022-01-31 23:23:54,351 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 23:23:54,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,353 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 23:23:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-01-31 23:23:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-31 23:23:54,376 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-01-31 23:23:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,376 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-31 23:23:54,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-31 23:23:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-31 23:23:54,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:23:54,377 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2022-01-31 23:23:54,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1360592254] [2022-01-31 23:23:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,381 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,436 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1360592254] [2022-01-31 23:23:54,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1360592254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:54,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918429243] [2022-01-31 23:23:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:54,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:54,439 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,549 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-01-31 23:23:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:54,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-01-31 23:23:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,550 INFO L225 Difference]: With dead ends: 73 [2022-01-31 23:23:54,550 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 23:23:54,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:54,552 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 23:23:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-01-31 23:23:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-01-31 23:23:54,564 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-01-31 23:23:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,564 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-01-31 23:23:54,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-01-31 23:23:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 23:23:54,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:23:54,578 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2022-01-31 23:23:54,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [781057951] [2022-01-31 23:23:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,586 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,639 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [781057951] [2022-01-31 23:23:54,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [781057951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:54,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731955503] [2022-01-31 23:23:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:54,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:54,641 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,771 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-01-31 23:23:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 23:23:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,772 INFO L225 Difference]: With dead ends: 71 [2022-01-31 23:23:54,772 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 23:23:54,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,773 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 23:23:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-01-31 23:23:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-01-31 23:23:54,786 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-01-31 23:23:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,786 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-01-31 23:23:54,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-01-31 23:23:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 23:23:54,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:23:54,788 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2022-01-31 23:23:54,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144920307] [2022-01-31 23:23:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,791 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,841 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144920307] [2022-01-31 23:23:54,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1144920307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:54,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275530840] [2022-01-31 23:23:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:54,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:54,844 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,965 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-01-31 23:23:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 23:23:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,966 INFO L225 Difference]: With dead ends: 69 [2022-01-31 23:23:54,966 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 23:23:54,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,967 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 23:23:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-01-31 23:23:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-01-31 23:23:54,978 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-01-31 23:23:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,978 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-01-31 23:23:54,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-01-31 23:23:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:54,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:23:54,980 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2022-01-31 23:23:54,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259068929] [2022-01-31 23:23:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,982 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:55,023 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:55,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259068929] [2022-01-31 23:23:55,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [259068929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:55,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:55,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:55,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022273283] [2022-01-31 23:23:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:55,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:55,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:55,025 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:55,116 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-01-31 23:23:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:55,117 INFO L225 Difference]: With dead ends: 67 [2022-01-31 23:23:55,117 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 23:23:55,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:55,118 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:55,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 23:23:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-01-31 23:23:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-01-31 23:23:55,127 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-01-31 23:23:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:55,127 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-01-31 23:23:55,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-01-31 23:23:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:55,128 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:55,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:55,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:23:55,129 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2022-01-31 23:23:55,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465966225] [2022-01-31 23:23:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:55,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:55,131 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:55,174 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465966225] [2022-01-31 23:23:55,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [465966225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:55,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:55,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:55,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597335483] [2022-01-31 23:23:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:55,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:55,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:55,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:55,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:55,175 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:55,357 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-01-31 23:23:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:55,361 INFO L225 Difference]: With dead ends: 104 [2022-01-31 23:23:55,361 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 23:23:55,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:55,362 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:55,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 157 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 23:23:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-01-31 23:23:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-01-31 23:23:55,379 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2022-01-31 23:23:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:55,379 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-01-31 23:23:55,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-01-31 23:23:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:55,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:55,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:55,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:23:55,385 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2022-01-31 23:23:55,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:55,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464561392] [2022-01-31 23:23:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:55,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:55,387 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:55,425 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464561392] [2022-01-31 23:23:55,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [464561392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:55,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:55,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:55,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640042010] [2022-01-31 23:23:55,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:55,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:55,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:55,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:55,426 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:55,511 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 23:23:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:55,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:55,513 INFO L225 Difference]: With dead ends: 61 [2022-01-31 23:23:55,513 INFO L226 Difference]: Without dead ends: 57 [2022-01-31 23:23:55,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:55,514 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:55,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-31 23:23:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-01-31 23:23:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-01-31 23:23:55,522 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-01-31 23:23:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:55,522 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-01-31 23:23:55,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-01-31 23:23:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:55,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:55,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:55,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:23:55,523 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2022-01-31 23:23:55,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:55,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [680640315] [2022-01-31 23:23:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:55,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:55,525 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:55,566 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [680640315] [2022-01-31 23:23:55,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [680640315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:55,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:55,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:55,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130753570] [2022-01-31 23:23:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:55,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:55,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:55,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:55,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:55,568 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:55,709 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-01-31 23:23:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:55,711 INFO L225 Difference]: With dead ends: 74 [2022-01-31 23:23:55,711 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 23:23:55,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:55,712 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:55,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 23:23:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-01-31 23:23:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-01-31 23:23:55,720 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-01-31 23:23:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:55,720 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-01-31 23:23:55,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-01-31 23:23:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:55,721 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:55,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:55,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:23:55,721 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2022-01-31 23:23:55,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:55,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065797363] [2022-01-31 23:23:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:55,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:55,723 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:55,761 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065797363] [2022-01-31 23:23:55,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2065797363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:55,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:55,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:55,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520202260] [2022-01-31 23:23:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:55,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:55,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:55,763 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:55,866 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-31 23:23:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:55,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:55,867 INFO L225 Difference]: With dead ends: 55 [2022-01-31 23:23:55,867 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 23:23:55,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:55,868 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:55,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 90 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 23:23:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-01-31 23:23:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-01-31 23:23:55,876 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-01-31 23:23:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:55,876 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-01-31 23:23:55,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-01-31 23:23:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:55,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:55,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:55,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:23:55,877 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2022-01-31 23:23:55,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:55,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218052207] [2022-01-31 23:23:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:55,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:55,879 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:55,952 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218052207] [2022-01-31 23:23:55,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [218052207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:55,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:55,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:55,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143411095] [2022-01-31 23:23:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:55,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:55,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:55,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:55,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:55,954 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:56,129 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-01-31 23:23:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:56,130 INFO L225 Difference]: With dead ends: 110 [2022-01-31 23:23:56,130 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 23:23:56,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:56,131 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:56,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 188 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 23:23:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-01-31 23:23:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-01-31 23:23:56,150 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-01-31 23:23:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:56,150 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-01-31 23:23:56,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-01-31 23:23:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:56,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:56,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:56,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:23:56,155 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2022-01-31 23:23:56,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461430580] [2022-01-31 23:23:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:56,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:56,160 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:56,210 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:56,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461430580] [2022-01-31 23:23:56,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [461430580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:56,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:56,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:56,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563582241] [2022-01-31 23:23:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:56,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:56,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:56,212 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:56,340 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-01-31 23:23:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:56,341 INFO L225 Difference]: With dead ends: 77 [2022-01-31 23:23:56,341 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 23:23:56,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:56,342 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:56,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 23:23:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-01-31 23:23:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-01-31 23:23:56,355 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-01-31 23:23:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:56,356 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-01-31 23:23:56,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-01-31 23:23:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:56,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:56,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:56,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:23:56,358 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2022-01-31 23:23:56,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:56,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [424578378] [2022-01-31 23:23:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:56,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:56,360 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:56,450 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [424578378] [2022-01-31 23:23:56,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [424578378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:56,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:56,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:56,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695091419] [2022-01-31 23:23:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:56,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:56,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:56,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:56,451 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:56,603 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-01-31 23:23:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:56,605 INFO L225 Difference]: With dead ends: 92 [2022-01-31 23:23:56,605 INFO L226 Difference]: Without dead ends: 90 [2022-01-31 23:23:56,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:56,606 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:56,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 134 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-31 23:23:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-01-31 23:23:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-01-31 23:23:56,629 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-01-31 23:23:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:56,629 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-01-31 23:23:56,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-01-31 23:23:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:56,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:56,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:56,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:23:56,630 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2022-01-31 23:23:56,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:56,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747226535] [2022-01-31 23:23:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:56,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:56,632 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:56,698 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:56,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747226535] [2022-01-31 23:23:56,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [747226535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:56,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:56,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:56,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383262526] [2022-01-31 23:23:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:56,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:56,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:56,700 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:56,836 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-01-31 23:23:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:56,837 INFO L225 Difference]: With dead ends: 76 [2022-01-31 23:23:56,837 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 23:23:56,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:56,837 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:56,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 136 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 23:23:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-01-31 23:23:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-01-31 23:23:56,848 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-01-31 23:23:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:56,848 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-01-31 23:23:56,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-01-31 23:23:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:56,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:56,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:56,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:23:56,849 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2022-01-31 23:23:56,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:56,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1375065631] [2022-01-31 23:23:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:56,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:56,851 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:56,919 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:56,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1375065631] [2022-01-31 23:23:56,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1375065631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:56,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:56,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:56,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658885578] [2022-01-31 23:23:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:56,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:56,920 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:57,071 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-01-31 23:23:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:23:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:57,073 INFO L225 Difference]: With dead ends: 72 [2022-01-31 23:23:57,073 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 23:23:57,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:23:57,076 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:57,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 121 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 23:23:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-01-31 23:23:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-01-31 23:23:57,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-01-31 23:23:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:57,087 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-01-31 23:23:57,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-01-31 23:23:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:23:57,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:57,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:57,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:23:57,090 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2022-01-31 23:23:57,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:57,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433849844] [2022-01-31 23:23:57,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:57,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:57,094 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:57,168 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:57,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433849844] [2022-01-31 23:23:57,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1433849844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:57,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:57,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:57,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951716024] [2022-01-31 23:23:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:57,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:57,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:57,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:57,169 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:57,340 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-01-31 23:23:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 23:23:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:57,342 INFO L225 Difference]: With dead ends: 91 [2022-01-31 23:23:57,342 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 23:23:57,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:57,345 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:57,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 162 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 23:23:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-01-31 23:23:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-01-31 23:23:57,357 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-01-31 23:23:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:57,358 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-01-31 23:23:57,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-01-31 23:23:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:23:57,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:57,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:57,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:23:57,359 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2022-01-31 23:23:57,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:57,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1442896107] [2022-01-31 23:23:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:57,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:57,361 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:57,397 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:57,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1442896107] [2022-01-31 23:23:57,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1442896107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:57,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:57,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:57,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204583966] [2022-01-31 23:23:57,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:57,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:57,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:57,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:57,399 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:57,468 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-01-31 23:23:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 23:23:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:57,469 INFO L225 Difference]: With dead ends: 67 [2022-01-31 23:23:57,469 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 23:23:57,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:57,469 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:57,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 23:23:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-31 23:23:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-01-31 23:23:57,492 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-01-31 23:23:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:57,492 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-01-31 23:23:57,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-01-31 23:23:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 23:23:57,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:57,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:57,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:23:57,493 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2022-01-31 23:23:57,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433332016] [2022-01-31 23:23:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:57,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:57,495 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:57,530 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433332016] [2022-01-31 23:23:57,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1433332016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:57,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:57,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:57,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509407504] [2022-01-31 23:23:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:57,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:57,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:57,531 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:57,601 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-01-31 23:23:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 23:23:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:57,602 INFO L225 Difference]: With dead ends: 65 [2022-01-31 23:23:57,602 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 23:23:57,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:57,602 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:57,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 23:23:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-31 23:23:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-01-31 23:23:57,615 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-01-31 23:23:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:57,615 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-01-31 23:23:57,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-01-31 23:23:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:57,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:57,615 INFO L514 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] [2022-01-31 23:23:57,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:23:57,616 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2022-01-31 23:23:57,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581957584] [2022-01-31 23:23:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:57,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:57,618 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:57,679 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:57,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581957584] [2022-01-31 23:23:57,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [581957584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:57,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:57,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:57,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618290098] [2022-01-31 23:23:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:57,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:57,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:57,681 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:57,827 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-01-31 23:23:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:23:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:57,828 INFO L225 Difference]: With dead ends: 76 [2022-01-31 23:23:57,828 INFO L226 Difference]: Without dead ends: 74 [2022-01-31 23:23:57,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:57,829 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:57,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 62 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-31 23:23:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-01-31 23:23:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-01-31 23:23:57,840 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-01-31 23:23:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:57,841 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-01-31 23:23:57,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-01-31 23:23:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:57,841 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:57,841 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:57,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:23:57,842 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2022-01-31 23:23:57,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:57,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425403019] [2022-01-31 23:23:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:57,857 INFO L92 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Could not compute Simultaneous Update! [2022-01-31 23:23:57,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:57,858 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:57,935 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:57,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425403019] [2022-01-31 23:23:57,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1425403019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:57,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:57,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:57,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117322165] [2022-01-31 23:23:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:57,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:57,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:57,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:57,936 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:58,065 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-01-31 23:23:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:58,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:23:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:58,066 INFO L225 Difference]: With dead ends: 72 [2022-01-31 23:23:58,066 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 23:23:58,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:58,067 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:58,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 55 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 23:23:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2022-01-31 23:23:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-01-31 23:23:58,078 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-01-31 23:23:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:58,079 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-01-31 23:23:58,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-01-31 23:23:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:23:58,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:58,079 INFO L514 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] [2022-01-31 23:23:58,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 23:23:58,080 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2022-01-31 23:23:58,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964905204] [2022-01-31 23:23:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:58,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:58,081 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:58,133 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:58,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964905204] [2022-01-31 23:23:58,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1964905204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:58,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:58,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:58,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371699249] [2022-01-31 23:23:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:58,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:58,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:58,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:58,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:58,135 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:58,276 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-01-31 23:23:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:58,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:23:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:58,277 INFO L225 Difference]: With dead ends: 64 [2022-01-31 23:23:58,277 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 23:23:58,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:58,278 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:58,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 52 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 23:23:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-01-31 23:23:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-01-31 23:23:58,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-01-31 23:23:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:58,311 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-01-31 23:23:58,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-01-31 23:23:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:23:58,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:58,312 INFO L514 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] [2022-01-31 23:23:58,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 23:23:58,313 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2022-01-31 23:23:58,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:58,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517136101] [2022-01-31 23:23:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:58,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:58,315 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:58,372 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517136101] [2022-01-31 23:23:58,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [517136101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:58,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:58,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:58,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811608846] [2022-01-31 23:23:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:58,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:58,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:58,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:58,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:58,374 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:58,496 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-31 23:23:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:23:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:58,497 INFO L225 Difference]: With dead ends: 47 [2022-01-31 23:23:58,497 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 23:23:58,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:23:58,499 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:58,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 23:23:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-31 23:23:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-01-31 23:23:58,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-01-31 23:23:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:58,505 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-01-31 23:23:58,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-01-31 23:23:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:23:58,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:58,506 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:58,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 23:23:58,506 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-31 23:23:58,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:58,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2022-01-31 23:23:58,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:58,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [139091819] [2022-01-31 23:23:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:58,510 INFO L92 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Could not compute Simultaneous Update! [2022-01-31 23:23:58,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:58,512 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:58,581 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:58,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [139091819] [2022-01-31 23:23:58,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [139091819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:58,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:58,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:58,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136013007] [2022-01-31 23:23:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:58,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:58,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:58,582 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:58,634 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-01-31 23:23:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:23:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:58,634 INFO L225 Difference]: With dead ends: 24 [2022-01-31 23:23:58,634 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:23:58,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:23:58,635 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:58,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:23:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:23:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 23:23:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:23:58,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-01-31 23:23:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:58,637 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:23:58,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:23:58,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:23:58,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-01-31 23:23:58,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-01-31 23:23:58,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-01-31 23:23:58,642 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-01-31 23:23:58,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 23:23:58,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:24:19,612 WARN L228 SmtUtils]: Spent 13.44s on a formula simplification. DAG size of input: 64 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 23:24:22,846 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:24:22,847 INFO L854 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2022-01-31 23:24:22,847 INFO L854 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-01-31 23:24:22,847 INFO L854 garLoopResultBuilder]: At program point L349(lines 349 358) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,848 INFO L854 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,848 INFO L854 garLoopResultBuilder]: At program point mainEXIT(lines 15 375) the Hoare annotation is: (or (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) (<= 0 main_~main__t~0)) [2022-01-31 23:24:22,848 INFO L854 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-01-31 23:24:22,848 INFO L854 garLoopResultBuilder]: At program point L308(lines 308 316) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-01-31 23:24:22,848 INFO L854 garLoopResultBuilder]: At program point L143(line 143) the Hoare annotation is: false [2022-01-31 23:24:22,849 INFO L854 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: false [2022-01-31 23:24:22,849 INFO L854 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) the Hoare annotation is: false [2022-01-31 23:24:22,850 INFO L854 garLoopResultBuilder]: At program point L102(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,850 INFO L854 garLoopResultBuilder]: At program point L325(lines 325 362) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1) (and (<= main_~main__t~0 1) .cse0 (< main_~main__t~0 main_~main__tagbuf_len~0) .cse1))) [2022-01-31 23:24:22,850 INFO L854 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: false [2022-01-31 23:24:22,850 INFO L854 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) the Hoare annotation is: false [2022-01-31 23:24:22,850 INFO L854 garLoopResultBuilder]: At program point L20(lines 20 374) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) the Hoare annotation is: false [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point L235(lines 235 243) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse4 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse4) (and .cse0 (<= main_~main__t~0 1) .cse1 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse2 .cse3 (not (= main_~main__tagbuf_len~0 0)) .cse4))) [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point L351(line 351) the Hoare annotation is: false [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point L153(lines 153 161) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) the Hoare annotation is: false [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point L54(lines 54 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0) .cse1) (and (<= 0 main_~main__tagbuf_len~0) .cse1 (= main_~main__t~0 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse0) (and (<= main_~main__t~0 1) .cse0)))) [2022-01-31 23:24:22,851 INFO L854 garLoopResultBuilder]: At program point L310(line 310) the Hoare annotation is: false [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point L277(lines 277 364) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point mainFINAL(lines 15 375) the Hoare annotation is: (or (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) (<= 0 main_~main__t~0)) [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) the Hoare annotation is: false [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point L71(lines 71 95) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:22,852 INFO L854 garLoopResultBuilder]: At program point L187(lines 187 197) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,853 INFO L854 garLoopResultBuilder]: At program point L113(lines 113 204) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,853 INFO L854 garLoopResultBuilder]: At program point L237(line 237) the Hoare annotation is: false [2022-01-31 23:24:22,853 INFO L854 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-01-31 23:24:22,853 INFO L854 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (or (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and (<= main_~main__t~0 1) .cse0) (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))) [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) the Hoare annotation is: false [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point L155(line 155) the Hoare annotation is: false [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: false [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) the Hoare annotation is: false [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point L279(line 279) the Hoare annotation is: false [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point L337(lines 337 360) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-01-31 23:24:22,854 INFO L854 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) the Hoare annotation is: false [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L106(lines 106 210) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: false [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L296(lines 296 318) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L32(lines 32 368) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L24(lines 24 369) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,855 INFO L854 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: false [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) the Hoare annotation is: false [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) the Hoare annotation is: false [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L289(lines 289 363) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0)) (.cse2 (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L223(lines 223 245) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse3 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse3) (and .cse0 (<= main_~main__t~0 1) .cse1 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse2 (not (= main_~main__tagbuf_len~0 0)) .cse3))) [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L83(lines 83 93) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L339(line 339) the Hoare annotation is: false [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L141(lines 141 163) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L42(lines 42 256) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0) .cse1) (and (<= 0 main_~main__tagbuf_len~0) .cse1 (= main_~main__t~0 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse0) (and (<= main_~main__t~0 1) .cse0)))) [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point L298(line 298) the Hoare annotation is: false [2022-01-31 23:24:22,856 INFO L854 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) the Hoare annotation is: false [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L125(lines 125 202) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L216(lines 216 251) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) the Hoare annotation is: false [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L175(lines 175 199) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L266(lines 266 366) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L134(lines 134 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (let ((.cse1 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse0) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-01-31 23:24:22,857 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:24:22,857 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 23:24:22,857 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:24:22,857 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:24:22,858 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 23:24:22,858 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 23:24:22,858 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:24:22,864 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:24:22,866 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:24:22,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:24:22 BoogieIcfgContainer [2022-01-31 23:24:22,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:24:22,881 INFO L158 Benchmark]: Toolchain (without parser) took 30248.47ms. Allocated memory was 178.3MB in the beginning and 544.2MB in the end (delta: 366.0MB). Free memory was 129.0MB in the beginning and 332.6MB in the end (delta: -203.6MB). Peak memory consumption was 251.9MB. Max. memory is 8.0GB. [2022-01-31 23:24:22,881 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:24:22,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.91ms. Allocated memory is still 178.3MB. Free memory was 128.8MB in the beginning and 149.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 23:24:22,881 INFO L158 Benchmark]: Boogie Preprocessor took 35.84ms. Allocated memory is still 178.3MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 23:24:22,882 INFO L158 Benchmark]: RCFGBuilder took 317.77ms. Allocated memory is still 178.3MB. Free memory was 147.6MB in the beginning and 133.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-31 23:24:22,882 INFO L158 Benchmark]: TraceAbstraction took 29633.04ms. Allocated memory was 178.3MB in the beginning and 544.2MB in the end (delta: 366.0MB). Free memory was 132.4MB in the beginning and 332.6MB in the end (delta: -200.2MB). Peak memory consumption was 256.5MB. Max. memory is 8.0GB. [2022-01-31 23:24:22,883 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.11ms. Allocated memory is still 178.3MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.91ms. Allocated memory is still 178.3MB. Free memory was 128.8MB in the beginning and 149.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.84ms. Allocated memory is still 178.3MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 317.77ms. Allocated memory is still 178.3MB. Free memory was 147.6MB in the beginning and 133.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 29633.04ms. Allocated memory was 178.3MB in the beginning and 544.2MB in the end (delta: 366.0MB). Free memory was 132.4MB in the beginning and 332.6MB in the end (delta: -200.2MB). Peak memory consumption was 256.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 83 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1407 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1407 mSDsluCounter, 2566 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1540 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3005 IncrementalHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 1026 mSDtfsCounter, 3005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 299 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 76 PreInvPairs, 101 NumberOfFragments, 953 HoareAnnotationTreeSize, 76 FomulaSimplifications, 25988 FormulaSimplificationTreeSizeReduction, 22.2s HoareSimplificationTime, 76 FomulaSimplificationsInter, 871907 FormulaSimplificationTreeSizeReductionInter, 2.0s 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && main__t == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t < main__tagbuf_len && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: ((\old(__return_305) == __return_305 && \old(__tmp_247_0) == __tmp_247_0) && \old(__tmp_383_0) == __tmp_383_0) || 0 <= main__t RESULT: Ultimate proved your program to be correct! [2022-01-31 23:24:22,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...