/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 02:36:20,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 02:36:20,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 02:36:20,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 02:36:20,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 02:36:20,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 02:36:20,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 02:36:21,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 02:36:21,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 02:36:21,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 02:36:21,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 02:36:21,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 02:36:21,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 02:36:21,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 02:36:21,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 02:36:21,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 02:36:21,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 02:36:21,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 02:36:21,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 02:36:21,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 02:36:21,027 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 02:36:21,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 02:36:21,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 02:36:21,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 02:36:21,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 02:36:21,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 02:36:21,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 02:36:21,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 02:36:21,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 02:36:21,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 02:36:21,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 02:36:21,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 02:36:21,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 02:36:21,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 02:36:21,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 02:36:21,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 02:36:21,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 02:36:21,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 02:36:21,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 02:36:21,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 02:36:21,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 02:36:21,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 02:36:21,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 02:36:21,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 02:36:21,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 02:36:21,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 02:36:21,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 02:36:21,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 02:36:21,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 02:36:21,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 02:36:21,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 02:36:21,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 02:36:21,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 02:36:21,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 02:36:21,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 02:36:21,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:36:21,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 02:36:21,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 02:36:21,060 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 02:36:21,060 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 02:36:21,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 02:36:21,060 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 02:36:21,060 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-03-19 02:36:21,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 02:36:21,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 02:36:21,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 02:36:21,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 02:36:21,342 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 02:36:21,343 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+lhb-reducer.c [2022-03-19 02:36:21,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacd05061/564a31775a5e425bbfd29d45c8afdf20/FLAG69fdb1ad0 [2022-03-19 02:36:21,773 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 02:36:21,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-03-19 02:36:21,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacd05061/564a31775a5e425bbfd29d45c8afdf20/FLAG69fdb1ad0 [2022-03-19 02:36:21,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacd05061/564a31775a5e425bbfd29d45c8afdf20 [2022-03-19 02:36:21,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 02:36:21,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 02:36:21,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 02:36:21,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 02:36:21,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 02:36:21,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:36:21" (1/1) ... [2022-03-19 02:36:21,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d219d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:21, skipping insertion in model container [2022-03-19 02:36:21,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:36:21" (1/1) ... [2022-03-19 02:36:21,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 02:36:21,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 02:36:21,995 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+lhb-reducer.c[1224,1237] [2022-03-19 02:36:21,999 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+lhb-reducer.c[1636,1649] [2022-03-19 02:36:22,000 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+lhb-reducer.c[1851,1864] [2022-03-19 02:36:22,002 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+lhb-reducer.c[2384,2397] [2022-03-19 02:36:22,003 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+lhb-reducer.c[2599,2612] [2022-03-19 02:36:22,005 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+lhb-reducer.c[2901,2914] [2022-03-19 02:36:22,006 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+lhb-reducer.c[3116,3129] [2022-03-19 02:36:22,007 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+lhb-reducer.c[3386,3399] [2022-03-19 02:36:22,008 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+lhb-reducer.c[3604,3617] [2022-03-19 02:36:22,010 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+lhb-reducer.c[4088,4101] [2022-03-19 02:36:22,012 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+lhb-reducer.c[4306,4319] [2022-03-19 02:36:22,014 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+lhb-reducer.c[4802,4815] [2022-03-19 02:36:22,015 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+lhb-reducer.c[5203,5216] [2022-03-19 02:36:22,016 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+lhb-reducer.c[5421,5434] [2022-03-19 02:36:22,021 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+lhb-reducer.c[5792,5805] [2022-03-19 02:36:22,022 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+lhb-reducer.c[6010,6023] [2022-03-19 02:36:22,023 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+lhb-reducer.c[6296,6309] [2022-03-19 02:36:22,024 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+lhb-reducer.c[6514,6527] [2022-03-19 02:36:22,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:36:22,032 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 02:36:22,047 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+lhb-reducer.c[1224,1237] [2022-03-19 02:36:22,048 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+lhb-reducer.c[1636,1649] [2022-03-19 02:36:22,049 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+lhb-reducer.c[1851,1864] [2022-03-19 02:36:22,051 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+lhb-reducer.c[2384,2397] [2022-03-19 02:36:22,052 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+lhb-reducer.c[2599,2612] [2022-03-19 02:36:22,053 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+lhb-reducer.c[2901,2914] [2022-03-19 02:36:22,054 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+lhb-reducer.c[3116,3129] [2022-03-19 02:36:22,055 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+lhb-reducer.c[3386,3399] [2022-03-19 02:36:22,056 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+lhb-reducer.c[3604,3617] [2022-03-19 02:36:22,058 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+lhb-reducer.c[4088,4101] [2022-03-19 02:36:22,059 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+lhb-reducer.c[4306,4319] [2022-03-19 02:36:22,070 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+lhb-reducer.c[4802,4815] [2022-03-19 02:36:22,071 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+lhb-reducer.c[5203,5216] [2022-03-19 02:36:22,072 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+lhb-reducer.c[5421,5434] [2022-03-19 02:36:22,073 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+lhb-reducer.c[5792,5805] [2022-03-19 02:36:22,074 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+lhb-reducer.c[6010,6023] [2022-03-19 02:36:22,075 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+lhb-reducer.c[6296,6309] [2022-03-19 02:36:22,076 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+lhb-reducer.c[6514,6527] [2022-03-19 02:36:22,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:36:22,097 INFO L208 MainTranslator]: Completed translation [2022-03-19 02:36:22,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22 WrapperNode [2022-03-19 02:36:22,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 02:36:22,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 02:36:22,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 02:36:22,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 02:36:22,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 02:36:22,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 02:36:22,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 02:36:22,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 02:36:22,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (1/1) ... [2022-03-19 02:36:22,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:36:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:36:22,167 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-03-19 02:36:22,169 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-03-19 02:36:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 02:36:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 02:36:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 02:36:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 02:36:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 02:36:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 02:36:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 02:36:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 02:36:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 02:36:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 02:36:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 02:36:22,262 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 02:36:22,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 02:36:22,495 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 02:36:22,501 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 02:36:22,501 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-19 02:36:22,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:36:22 BoogieIcfgContainer [2022-03-19 02:36:22,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 02:36:22,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 02:36:22,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 02:36:22,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 02:36:22,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 02:36:21" (1/3) ... [2022-03-19 02:36:22,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d6831b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:36:22, skipping insertion in model container [2022-03-19 02:36:22,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:36:22" (2/3) ... [2022-03-19 02:36:22,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d6831b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:36:22, skipping insertion in model container [2022-03-19 02:36:22,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:36:22" (3/3) ... [2022-03-19 02:36:22,517 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-03-19 02:36:22,521 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 02:36:22,521 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-19 02:36:22,561 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 02:36:22,566 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, 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 [2022-03-19 02:36:22,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-03-19 02:36:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-03-19 02:36:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-19 02:36:22,587 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:22,587 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:22,588 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-03-19 02:36:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:22,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1673233413] [2022-03-19 02:36:22,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 2 times [2022-03-19 02:36:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:22,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131755294] [2022-03-19 02:36:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131755294] [2022-03-19 02:36:22,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131755294] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:22,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:22,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:22,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:22,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1673233413] [2022-03-19 02:36:22,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1673233413] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:22,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:22,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47788237] [2022-03-19 02:36:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:22,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:36:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:22,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:36:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:36:22,927 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-03-19 02:36:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:23,234 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-03-19 02:36:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:36:23,237 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-03-19 02:36:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:23,244 INFO L225 Difference]: With dead ends: 129 [2022-03-19 02:36:23,244 INFO L226 Difference]: Without dead ends: 111 [2022-03-19 02:36:23,249 INFO L911 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-03-19 02:36:23,252 INFO L912 BasicCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:23,253 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:36:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-19 02:36:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-03-19 02:36:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 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-03-19 02:36:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-03-19 02:36:23,284 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-03-19 02:36:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:23,285 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-03-19 02:36:23,285 INFO L479 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-03-19 02:36:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-03-19 02:36:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-19 02:36:23,285 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:23,285 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:23,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 02:36:23,286 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:23,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-03-19 02:36:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:23,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507001852] [2022-03-19 02:36:23,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 2 times [2022-03-19 02:36:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:23,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226977106] [2022-03-19 02:36:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:23,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:23,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226977106] [2022-03-19 02:36:23,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226977106] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:23,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:23,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:23,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:23,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507001852] [2022-03-19 02:36:23,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507001852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:23,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:23,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697514857] [2022-03-19 02:36:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:23,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:36:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:36:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:36:23,369 INFO L87 Difference]: Start difference. First operand 73 states and 77 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-03-19 02:36:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:23,540 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-03-19 02:36:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:36:23,541 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-03-19 02:36:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:23,542 INFO L225 Difference]: With dead ends: 111 [2022-03-19 02:36:23,542 INFO L226 Difference]: Without dead ends: 109 [2022-03-19 02:36:23,543 INFO L911 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-03-19 02:36:23,544 INFO L912 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:23,545 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-19 02:36:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-03-19 02:36:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 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-03-19 02:36:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-03-19 02:36:23,556 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-03-19 02:36:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:23,557 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-03-19 02:36:23,557 INFO L479 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-03-19 02:36:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-03-19 02:36:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 02:36:23,558 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:23,558 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:23,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 02:36:23,558 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-03-19 02:36:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:23,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469845702] [2022-03-19 02:36:23,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 2 times [2022-03-19 02:36:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484873502] [2022-03-19 02:36:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:23,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484873502] [2022-03-19 02:36:23,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484873502] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:23,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:23,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:23,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469845702] [2022-03-19 02:36:23,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469845702] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:23,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:23,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672067750] [2022-03-19 02:36:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:23,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:23,674 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-03-19 02:36:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:23,846 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-03-19 02:36:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:23,848 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-03-19 02:36:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:23,851 INFO L225 Difference]: With dead ends: 73 [2022-03-19 02:36:23,851 INFO L226 Difference]: Without dead ends: 71 [2022-03-19 02:36:23,854 INFO L911 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-03-19 02:36:23,859 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 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-03-19 02:36:23,860 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-19 02:36:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-03-19 02:36:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) 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-03-19 02:36:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-03-19 02:36:23,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-03-19 02:36:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:23,871 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-03-19 02:36:23,871 INFO L479 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-03-19 02:36:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-03-19 02:36:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 02:36:23,875 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:23,875 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:23,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 02:36:23,876 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-03-19 02:36:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896546165] [2022-03-19 02:36:23,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 2 times [2022-03-19 02:36:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:23,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036612747] [2022-03-19 02:36:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:23,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036612747] [2022-03-19 02:36:23,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036612747] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:23,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:23,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:23,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:23,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896546165] [2022-03-19 02:36:23,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896546165] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:23,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:23,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206530918] [2022-03-19 02:36:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:23,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:23,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:23,993 INFO L87 Difference]: Start difference. First operand 69 states and 73 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-03-19 02:36:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:24,143 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-03-19 02:36:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:24,144 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-03-19 02:36:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:24,145 INFO L225 Difference]: With dead ends: 71 [2022-03-19 02:36:24,145 INFO L226 Difference]: Without dead ends: 69 [2022-03-19 02:36:24,146 INFO L911 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-03-19 02:36:24,147 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 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-03-19 02:36:24,148 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-19 02:36:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-03-19 02:36:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) 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-03-19 02:36:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-03-19 02:36:24,166 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-03-19 02:36:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:24,166 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-03-19 02:36:24,166 INFO L479 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-03-19 02:36:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-03-19 02:36:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 02:36:24,167 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:24,167 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:24,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 02:36:24,168 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-03-19 02:36:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387792324] [2022-03-19 02:36:24,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 2 times [2022-03-19 02:36:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:24,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626584312] [2022-03-19 02:36:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:24,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:24,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626584312] [2022-03-19 02:36:24,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626584312] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:24,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:24,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387792324] [2022-03-19 02:36:24,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387792324] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668705917] [2022-03-19 02:36:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:24,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:36:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:36:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:36:24,267 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-03-19 02:36:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:24,368 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-03-19 02:36:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:36:24,368 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-03-19 02:36:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:24,370 INFO L225 Difference]: With dead ends: 69 [2022-03-19 02:36:24,370 INFO L226 Difference]: Without dead ends: 65 [2022-03-19 02:36:24,370 INFO L911 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-03-19 02:36:24,372 INFO L912 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:24,372 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-19 02:36:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-03-19 02:36:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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-03-19 02:36:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-03-19 02:36:24,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-03-19 02:36:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:24,387 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-03-19 02:36:24,388 INFO L479 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-03-19 02:36:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-03-19 02:36:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 02:36:24,388 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:24,389 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:24,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 02:36:24,390 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-03-19 02:36:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731379687] [2022-03-19 02:36:24,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 2 times [2022-03-19 02:36:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:24,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786765324] [2022-03-19 02:36:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:24,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786765324] [2022-03-19 02:36:24,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786765324] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:24,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:24,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731379687] [2022-03-19 02:36:24,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731379687] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950334779] [2022-03-19 02:36:24,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:24,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:24,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:24,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:24,463 INFO L87 Difference]: Start difference. First operand 63 states and 67 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-03-19 02:36:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:24,629 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-03-19 02:36:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:24,631 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-03-19 02:36:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:24,632 INFO L225 Difference]: With dead ends: 108 [2022-03-19 02:36:24,632 INFO L226 Difference]: Without dead ends: 106 [2022-03-19 02:36:24,633 INFO L911 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-03-19 02:36:24,637 INFO L912 BasicCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:24,637 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-19 02:36:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-03-19 02:36:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 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-03-19 02:36:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-03-19 02:36:24,658 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-03-19 02:36:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:24,659 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-03-19 02:36:24,660 INFO L479 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-03-19 02:36:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-03-19 02:36:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 02:36:24,661 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:24,661 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:24,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 02:36:24,661 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-03-19 02:36:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525123875] [2022-03-19 02:36:24,662 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 2 times [2022-03-19 02:36:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:24,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319968693] [2022-03-19 02:36:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:24,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319968693] [2022-03-19 02:36:24,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319968693] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:24,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:24,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525123875] [2022-03-19 02:36:24,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525123875] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168854571] [2022-03-19 02:36:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:24,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:24,728 INFO L87 Difference]: Start difference. First operand 61 states and 65 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-03-19 02:36:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:24,878 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-03-19 02:36:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:24,879 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-03-19 02:36:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:24,880 INFO L225 Difference]: With dead ends: 93 [2022-03-19 02:36:24,880 INFO L226 Difference]: Without dead ends: 91 [2022-03-19 02:36:24,880 INFO L911 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-03-19 02:36:24,881 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:24,881 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-19 02:36:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-03-19 02:36:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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-03-19 02:36:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-03-19 02:36:24,891 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-03-19 02:36:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:24,892 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-03-19 02:36:24,892 INFO L479 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-03-19 02:36:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-03-19 02:36:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 02:36:24,895 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:24,895 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:24,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 02:36:24,895 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-03-19 02:36:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571184736] [2022-03-19 02:36:24,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 2 times [2022-03-19 02:36:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:24,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338945328] [2022-03-19 02:36:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:24,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-03-19 02:36:24,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:24,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338945328] [2022-03-19 02:36:24,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338945328] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:24,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:24,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571184736] [2022-03-19 02:36:24,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571184736] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:24,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:24,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:24,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262872108] [2022-03-19 02:36:24,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:24,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:36:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:24,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:36:24,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:36:24,954 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-03-19 02:36:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:25,039 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-03-19 02:36:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:36:25,043 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-03-19 02:36:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:25,044 INFO L225 Difference]: With dead ends: 61 [2022-03-19 02:36:25,044 INFO L226 Difference]: Without dead ends: 57 [2022-03-19 02:36:25,045 INFO L911 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-03-19 02:36:25,045 INFO L912 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 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-03-19 02:36:25,045 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-19 02:36:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-03-19 02:36:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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-03-19 02:36:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-03-19 02:36:25,053 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-03-19 02:36:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:25,053 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-03-19 02:36:25,053 INFO L479 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-03-19 02:36:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-03-19 02:36:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 02:36:25,055 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:25,055 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:25,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 02:36:25,056 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-03-19 02:36:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022546021] [2022-03-19 02:36:25,058 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 2 times [2022-03-19 02:36:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:25,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205926550] [2022-03-19 02:36:25,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:25,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:25,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205926550] [2022-03-19 02:36:25,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205926550] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:25,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:25,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022546021] [2022-03-19 02:36:25,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022546021] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303154895] [2022-03-19 02:36:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:25,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:25,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:25,123 INFO L87 Difference]: Start difference. First operand 55 states and 59 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-03-19 02:36:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:25,259 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-03-19 02:36:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:25,259 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-03-19 02:36:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:25,260 INFO L225 Difference]: With dead ends: 74 [2022-03-19 02:36:25,260 INFO L226 Difference]: Without dead ends: 72 [2022-03-19 02:36:25,260 INFO L911 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-03-19 02:36:25,262 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:25,263 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-19 02:36:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-03-19 02:36:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 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-03-19 02:36:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-03-19 02:36:25,272 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-03-19 02:36:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:25,273 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-03-19 02:36:25,273 INFO L479 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-03-19 02:36:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-03-19 02:36:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 02:36:25,275 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:25,275 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:25,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 02:36:25,275 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-03-19 02:36:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465132006] [2022-03-19 02:36:25,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 2 times [2022-03-19 02:36:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801756412] [2022-03-19 02:36:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:25,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801756412] [2022-03-19 02:36:25,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801756412] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:25,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:25,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465132006] [2022-03-19 02:36:25,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465132006] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468527249] [2022-03-19 02:36:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:25,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:25,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:25,345 INFO L87 Difference]: Start difference. First operand 53 states and 57 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-03-19 02:36:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:25,444 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-03-19 02:36:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:25,444 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-03-19 02:36:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:25,445 INFO L225 Difference]: With dead ends: 55 [2022-03-19 02:36:25,445 INFO L226 Difference]: Without dead ends: 53 [2022-03-19 02:36:25,445 INFO L911 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-03-19 02:36:25,446 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:25,446 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-19 02:36:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-03-19 02:36:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 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-03-19 02:36:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-03-19 02:36:25,452 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-03-19 02:36:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:25,452 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-03-19 02:36:25,452 INFO L479 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-03-19 02:36:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-03-19 02:36:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 02:36:25,453 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:25,453 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:25,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 02:36:25,453 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-03-19 02:36:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116823321] [2022-03-19 02:36:25,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 2 times [2022-03-19 02:36:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:25,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644085022] [2022-03-19 02:36:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:25,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:25,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:25,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644085022] [2022-03-19 02:36:25,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644085022] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:25,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:25,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116823321] [2022-03-19 02:36:25,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116823321] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114362040] [2022-03-19 02:36:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:25,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:36:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:36:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:36:25,540 INFO L87 Difference]: Start difference. First operand 51 states and 55 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-03-19 02:36:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:25,710 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-03-19 02:36:25,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:25,711 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-03-19 02:36:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:25,712 INFO L225 Difference]: With dead ends: 110 [2022-03-19 02:36:25,712 INFO L226 Difference]: Without dead ends: 108 [2022-03-19 02:36:25,712 INFO L911 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-03-19 02:36:25,713 INFO L912 BasicCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:25,713 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-19 02:36:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-03-19 02:36:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 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-03-19 02:36:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-03-19 02:36:25,721 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-03-19 02:36:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:25,721 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-03-19 02:36:25,721 INFO L479 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-03-19 02:36:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-03-19 02:36:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 02:36:25,722 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:25,722 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:25,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 02:36:25,722 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-03-19 02:36:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44711161] [2022-03-19 02:36:25,723 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 2 times [2022-03-19 02:36:25,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:25,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008161377] [2022-03-19 02:36:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:25,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008161377] [2022-03-19 02:36:25,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008161377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:25,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44711161] [2022-03-19 02:36:25,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44711161] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:25,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182672007] [2022-03-19 02:36:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:25,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:36:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:36:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:36:25,806 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-03-19 02:36:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:25,993 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-03-19 02:36:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:25,994 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-03-19 02:36:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:25,995 INFO L225 Difference]: With dead ends: 108 [2022-03-19 02:36:25,995 INFO L226 Difference]: Without dead ends: 106 [2022-03-19 02:36:25,995 INFO L911 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-03-19 02:36:25,995 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:25,996 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-19 02:36:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-03-19 02:36:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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-03-19 02:36:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-03-19 02:36:26,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-03-19 02:36:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:26,005 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-03-19 02:36:26,005 INFO L479 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-03-19 02:36:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-03-19 02:36:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 02:36:26,005 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:26,005 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:26,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 02:36:26,006 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-03-19 02:36:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456859434] [2022-03-19 02:36:26,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 2 times [2022-03-19 02:36:26,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:26,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978067942] [2022-03-19 02:36:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:26,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978067942] [2022-03-19 02:36:26,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978067942] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:26,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:26,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456859434] [2022-03-19 02:36:26,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456859434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:36:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008216090] [2022-03-19 02:36:26,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:26,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:36:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:36:26,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:36:26,049 INFO L87 Difference]: Start difference. First operand 58 states and 63 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-03-19 02:36:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:26,173 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-03-19 02:36:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:36:26,174 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-03-19 02:36:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:26,174 INFO L225 Difference]: With dead ends: 79 [2022-03-19 02:36:26,174 INFO L226 Difference]: Without dead ends: 77 [2022-03-19 02:36:26,175 INFO L911 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-03-19 02:36:26,175 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:26,175 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-19 02:36:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-03-19 02:36:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 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-03-19 02:36:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-03-19 02:36:26,184 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-03-19 02:36:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:26,184 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-03-19 02:36:26,185 INFO L479 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-03-19 02:36:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-03-19 02:36:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 02:36:26,185 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:26,185 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:26,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 02:36:26,185 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-03-19 02:36:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2058130455] [2022-03-19 02:36:26,186 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 2 times [2022-03-19 02:36:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:26,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962240924] [2022-03-19 02:36:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962240924] [2022-03-19 02:36:26,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962240924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:26,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:26,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2058130455] [2022-03-19 02:36:26,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2058130455] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:26,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652865206] [2022-03-19 02:36:26,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:26,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:36:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:36:26,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:36:26,282 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-03-19 02:36:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:26,439 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-03-19 02:36:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:26,440 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-03-19 02:36:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:26,442 INFO L225 Difference]: With dead ends: 90 [2022-03-19 02:36:26,442 INFO L226 Difference]: Without dead ends: 88 [2022-03-19 02:36:26,442 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-19 02:36:26,442 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:26,443 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-19 02:36:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-03-19 02:36:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 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-03-19 02:36:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-03-19 02:36:26,453 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-03-19 02:36:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:26,453 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-03-19 02:36:26,453 INFO L479 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-03-19 02:36:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-03-19 02:36:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 02:36:26,454 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:26,454 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:26,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 02:36:26,454 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-03-19 02:36:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713891056] [2022-03-19 02:36:26,455 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 2 times [2022-03-19 02:36:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:26,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662192160] [2022-03-19 02:36:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:26,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662192160] [2022-03-19 02:36:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662192160] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:26,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713891056] [2022-03-19 02:36:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713891056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362267191] [2022-03-19 02:36:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:26,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:36:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:36:26,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:36:26,528 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-03-19 02:36:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:26,650 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-03-19 02:36:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:36:26,655 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-03-19 02:36:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:26,656 INFO L225 Difference]: With dead ends: 74 [2022-03-19 02:36:26,656 INFO L226 Difference]: Without dead ends: 70 [2022-03-19 02:36:26,658 INFO L911 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-03-19 02:36:26,659 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:26,659 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-19 02:36:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-03-19 02:36:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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-03-19 02:36:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-03-19 02:36:26,670 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-03-19 02:36:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:26,672 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-03-19 02:36:26,672 INFO L479 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-03-19 02:36:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-03-19 02:36:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 02:36:26,674 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:26,674 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:26,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 02:36:26,675 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-03-19 02:36:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161342080] [2022-03-19 02:36:26,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:26,676 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 2 times [2022-03-19 02:36:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:26,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474018992] [2022-03-19 02:36:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:26,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474018992] [2022-03-19 02:36:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474018992] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:26,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161342080] [2022-03-19 02:36:26,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161342080] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:26,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:26,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129988323] [2022-03-19 02:36:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:26,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:36:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:26,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:36:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:36:26,776 INFO L87 Difference]: Start difference. First operand 63 states and 70 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-03-19 02:36:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:27,001 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-03-19 02:36:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:27,003 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-03-19 02:36:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:27,004 INFO L225 Difference]: With dead ends: 91 [2022-03-19 02:36:27,004 INFO L226 Difference]: Without dead ends: 89 [2022-03-19 02:36:27,004 INFO L911 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-03-19 02:36:27,005 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:27,005 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:36:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-19 02:36:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-03-19 02:36:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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-03-19 02:36:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-03-19 02:36:27,016 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-03-19 02:36:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:27,016 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-03-19 02:36:27,016 INFO L479 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-03-19 02:36:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-03-19 02:36:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 02:36:27,016 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:27,017 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:27,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 02:36:27,017 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-03-19 02:36:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193806753] [2022-03-19 02:36:27,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 2 times [2022-03-19 02:36:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622658107] [2022-03-19 02:36:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:27,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622658107] [2022-03-19 02:36:27,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622658107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:27,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:27,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:27,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:27,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193806753] [2022-03-19 02:36:27,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193806753] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:27,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:27,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968411056] [2022-03-19 02:36:27,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:27,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:36:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:36:27,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:36:27,054 INFO L87 Difference]: Start difference. First operand 66 states and 73 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-03-19 02:36:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:27,122 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-03-19 02:36:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:36:27,123 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-03-19 02:36:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:27,123 INFO L225 Difference]: With dead ends: 66 [2022-03-19 02:36:27,123 INFO L226 Difference]: Without dead ends: 64 [2022-03-19 02:36:27,124 INFO L911 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-03-19 02:36:27,124 INFO L912 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:27,124 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:36:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-19 02:36:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-03-19 02:36:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) 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-03-19 02:36:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-03-19 02:36:27,134 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-03-19 02:36:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:27,135 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-03-19 02:36:27,135 INFO L479 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-03-19 02:36:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-03-19 02:36:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 02:36:27,135 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:27,135 INFO L500 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-03-19 02:36:27,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 02:36:27,135 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-03-19 02:36:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812632299] [2022-03-19 02:36:27,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 2 times [2022-03-19 02:36:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671073109] [2022-03-19 02:36:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:27,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671073109] [2022-03-19 02:36:27,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671073109] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:27,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:27,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:27,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:27,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812632299] [2022-03-19 02:36:27,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812632299] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:27,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:27,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:36:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661178134] [2022-03-19 02:36:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:27,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:36:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:36:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:36:27,173 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-03-19 02:36:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:27,254 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-03-19 02:36:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:36:27,254 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-03-19 02:36:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:27,255 INFO L225 Difference]: With dead ends: 64 [2022-03-19 02:36:27,255 INFO L226 Difference]: Without dead ends: 60 [2022-03-19 02:36:27,255 INFO L911 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-03-19 02:36:27,256 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:27,256 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-19 02:36:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-03-19 02:36:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) 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-03-19 02:36:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-03-19 02:36:27,266 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-03-19 02:36:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:27,266 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-03-19 02:36:27,266 INFO L479 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-03-19 02:36:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-03-19 02:36:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:36:27,266 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:27,266 INFO L500 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-03-19 02:36:27,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 02:36:27,267 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-03-19 02:36:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760682288] [2022-03-19 02:36:27,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 2 times [2022-03-19 02:36:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:27,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451265660] [2022-03-19 02:36:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:27,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451265660] [2022-03-19 02:36:27,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451265660] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:27,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:27,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:27,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760682288] [2022-03-19 02:36:27,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760682288] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:27,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:36:27,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331136111] [2022-03-19 02:36:27,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:27,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:36:27,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:36:27,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:36:27,336 INFO L87 Difference]: Start difference. First operand 60 states and 67 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-03-19 02:36:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:27,494 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-03-19 02:36:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:27,495 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-03-19 02:36:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:27,495 INFO L225 Difference]: With dead ends: 75 [2022-03-19 02:36:27,495 INFO L226 Difference]: Without dead ends: 73 [2022-03-19 02:36:27,496 INFO L911 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-03-19 02:36:27,496 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:27,496 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-19 02:36:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-03-19 02:36:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-03-19 02:36:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-03-19 02:36:27,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-03-19 02:36:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:27,506 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-03-19 02:36:27,506 INFO L479 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-03-19 02:36:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-03-19 02:36:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:36:27,506 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:27,506 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:27,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 02:36:27,507 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-03-19 02:36:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:27,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669278074] [2022-03-19 02:36:27,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 2 times [2022-03-19 02:36:27,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:27,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092895342] [2022-03-19 02:36:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:27,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092895342] [2022-03-19 02:36:27,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092895342] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 02:36:27,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039678501] [2022-03-19 02:36:27,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 02:36:27,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:36:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:36:27,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 02:36:27,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 02:36:27,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 02:36:27,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 02:36:27,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-19 02:36:27,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 02:36:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:28,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 02:36:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 02:36:28,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039678501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 02:36:28,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 02:36:28,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-03-19 02:36:28,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:28,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669278074] [2022-03-19 02:36:28,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669278074] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:28,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:28,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:36:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914858973] [2022-03-19 02:36:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:28,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 02:36:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 02:36:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-19 02:36:28,084 INFO L87 Difference]: Start difference. First operand 55 states and 62 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-03-19 02:36:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:28,236 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-03-19 02:36:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:28,237 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-03-19 02:36:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:28,237 INFO L225 Difference]: With dead ends: 72 [2022-03-19 02:36:28,237 INFO L226 Difference]: Without dead ends: 70 [2022-03-19 02:36:28,238 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-19 02:36:28,239 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:28,239 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 60 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-19 02:36:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-03-19 02:36:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-03-19 02:36:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-03-19 02:36:28,255 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-03-19 02:36:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:28,256 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-03-19 02:36:28,256 INFO L479 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-03-19 02:36:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-03-19 02:36:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:36:28,257 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:28,257 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:36:28,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 02:36:28,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:36:28,481 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-03-19 02:36:28,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:28,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855892866] [2022-03-19 02:36:28,482 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 2 times [2022-03-19 02:36:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:28,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006603589] [2022-03-19 02:36:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006603589] [2022-03-19 02:36:28,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006603589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 02:36:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541521531] [2022-03-19 02:36:28,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 02:36:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:36:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:36:28,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 02:36:28,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 02:36:28,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 02:36:28,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 02:36:28,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-19 02:36:28,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 02:36:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:28,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 02:36:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 02:36:28,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541521531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 02:36:28,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 02:36:28,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-03-19 02:36:28,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:28,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855892866] [2022-03-19 02:36:28,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855892866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:28,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:28,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:36:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075605545] [2022-03-19 02:36:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:28,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 02:36:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 02:36:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-19 02:36:28,916 INFO L87 Difference]: Start difference. First operand 51 states and 58 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-03-19 02:36:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:29,064 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-03-19 02:36:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:29,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-03-19 02:36:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:29,065 INFO L225 Difference]: With dead ends: 67 [2022-03-19 02:36:29,066 INFO L226 Difference]: Without dead ends: 65 [2022-03-19 02:36:29,066 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-19 02:36:29,066 INFO L912 BasicCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:29,067 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 53 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-19 02:36:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2022-03-19 02:36:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-03-19 02:36:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-03-19 02:36:29,080 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-03-19 02:36:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:29,080 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-03-19 02:36:29,080 INFO L479 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-03-19 02:36:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-03-19 02:36:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 02:36:29,080 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:29,080 INFO L500 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-03-19 02:36:29,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 02:36:29,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-19 02:36:29,296 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-03-19 02:36:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:29,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404054307] [2022-03-19 02:36:29,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 2 times [2022-03-19 02:36:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:29,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827068594] [2022-03-19 02:36:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:29,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827068594] [2022-03-19 02:36:29,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827068594] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:29,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:29,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:36:29,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:29,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404054307] [2022-03-19 02:36:29,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404054307] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:29,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:29,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:36:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587653540] [2022-03-19 02:36:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:29,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 02:36:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 02:36:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:36:29,368 INFO L87 Difference]: Start difference. First operand 44 states and 50 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-03-19 02:36:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:29,488 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-03-19 02:36:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:36:29,489 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-03-19 02:36:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:29,490 INFO L225 Difference]: With dead ends: 56 [2022-03-19 02:36:29,490 INFO L226 Difference]: Without dead ends: 54 [2022-03-19 02:36:29,491 INFO L911 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-03-19 02:36:29,492 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:29,492 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 53 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:36:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-19 02:36:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-03-19 02:36:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-03-19 02:36:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-03-19 02:36:29,501 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-03-19 02:36:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:29,501 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-03-19 02:36:29,502 INFO L479 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-03-19 02:36:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-03-19 02:36:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 02:36:29,502 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:36:29,502 INFO L500 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-03-19 02:36:29,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-19 02:36:29,502 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:36:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:36:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-03-19 02:36:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:29,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047257537] [2022-03-19 02:36:29,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:36:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 2 times [2022-03-19 02:36:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:36:29,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705784524] [2022-03-19 02:36:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:36:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:36:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:36:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:36:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:36:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:36:29,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705784524] [2022-03-19 02:36:29,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705784524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:29,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:29,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:36:29,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:36:29,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047257537] [2022-03-19 02:36:29,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047257537] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:36:29,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:36:29,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:36:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342264066] [2022-03-19 02:36:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:36:29,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 02:36:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:36:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 02:36:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:36:29,596 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-03-19 02:36:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:36:29,671 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-03-19 02:36:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:36:29,672 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-03-19 02:36:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:36:29,672 INFO L225 Difference]: With dead ends: 39 [2022-03-19 02:36:29,672 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 02:36:29,673 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-03-19 02:36:29,674 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:36:29,674 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 38 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:36:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 02:36:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 02:36:29,675 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-03-19 02:36:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 02:36:29,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-03-19 02:36:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:36:29,675 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 02:36:29,675 INFO L479 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-03-19 02:36:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 02:36:29,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 02:36:29,680 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-03-19 02:36:29,680 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-03-19 02:36:29,680 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-03-19 02:36:29,680 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-03-19 02:36:29,681 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-03-19 02:36:29,682 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-03-19 02:36:29,683 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-03-19 02:36:29,683 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-03-19 02:36:29,683 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-03-19 02:36:29,683 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-03-19 02:36:29,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-19 02:36:29,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 02:36:40,795 WARN L232 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 62 DAG size of output: 62 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 02:36:58,126 WARN L232 SmtUtils]: Spent 14.56s on a formula simplification. DAG size of input: 76 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:37:01,985 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L126(line 126) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 402) the Hoare annotation is: true [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L176(line 176) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L366(line 366) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L333(line 333) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 242) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2))) [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) the Hoare annotation is: false [2022-03-19 02:37:01,986 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 160) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 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-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) the Hoare annotation is: false [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: false [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 401) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L276(lines 276 391) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) the Hoare annotation is: false [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L70(lines 70 94) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (and (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse1)))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-03-19 02:37:01,987 INFO L878 garLoopResultBuilder]: At program point L186(lines 186 196) the Hoare annotation is: (and (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-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point L376(lines 376 385) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~18 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~19 0))) [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) the Hoare annotation is: false [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point L343(lines 343 352) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point L112(lines 112 203) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,988 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 402) the Hoare annotation is: true [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) the Hoare annotation is: false [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) the Hoare annotation is: false [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-03-19 02:37:01,988 INFO L878 garLoopResultBuilder]: At program point L154(line 154) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L278(line 278) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L105(lines 105 209) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 255) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L295(lines 295 317) 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-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L188(line 188) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point L345(line 345) the Hoare annotation is: false [2022-03-19 02:37:01,989 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) the Hoare annotation is: false [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: false [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) the Hoare annotation is: false [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L32(lines 32 395) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L288(lines 288 390) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) the Hoare annotation is: false [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L222(lines 222 244) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L24(lines 24 396) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L82(lines 82 92) the Hoare annotation is: (and (<= 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-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 162) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 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-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) the Hoare annotation is: false [2022-03-19 02:37:01,990 INFO L878 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: false [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) the Hoare annotation is: false [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L124(lines 124 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,991 INFO L885 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L215(lines 215 250) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L50(lines 50 253) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L174(lines 174 198) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) the Hoare annotation is: false [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L364(lines 364 387) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~18 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L331(lines 331 354) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,991 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 393) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) the Hoare annotation is: false [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L133(lines 133 200) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: false [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) the Hoare annotation is: false [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L307(lines 307 315) 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-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) the Hoare annotation is: false [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: false [2022-03-19 02:37:01,992 INFO L878 garLoopResultBuilder]: At program point L101(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:37:01,993 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 389) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0)))))) [2022-03-19 02:37:01,993 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:37:01,993 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 02:37:01,993 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:37:01,993 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:37:01,993 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 02:37:01,993 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 02:37:01,993 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:37:01,996 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 02:37:01,997 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 02:37:02,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 02:37:02 BoogieIcfgContainer [2022-03-19 02:37:02,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 02:37:02,014 INFO L158 Benchmark]: Toolchain (without parser) took 40218.97ms. Allocated memory was 184.5MB in the beginning and 632.3MB in the end (delta: 447.7MB). Free memory was 133.9MB in the beginning and 297.2MB in the end (delta: -163.3MB). Peak memory consumption was 359.2MB. Max. memory is 8.0GB. [2022-03-19 02:37:02,014 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 02:37:02,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.65ms. Allocated memory is still 184.5MB. Free memory was 133.6MB in the beginning and 153.8MB in the end (delta: -20.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-03-19 02:37:02,015 INFO L158 Benchmark]: Boogie Preprocessor took 35.80ms. Allocated memory is still 184.5MB. Free memory was 153.8MB in the beginning and 152.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 02:37:02,015 INFO L158 Benchmark]: RCFGBuilder took 372.79ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 137.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-19 02:37:02,015 INFO L158 Benchmark]: TraceAbstraction took 39504.43ms. Allocated memory was 184.5MB in the beginning and 632.3MB in the end (delta: 447.7MB). Free memory was 136.6MB in the beginning and 297.2MB in the end (delta: -160.6MB). Peak memory consumption was 362.7MB. Max. memory is 8.0GB. [2022-03-19 02:37:02,016 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 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.65ms. Allocated memory is still 184.5MB. Free memory was 133.6MB in the beginning and 153.8MB in the end (delta: -20.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.80ms. Allocated memory is still 184.5MB. Free memory was 153.8MB in the beginning and 152.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 372.79ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 137.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 39504.43ms. Allocated memory was 184.5MB in the beginning and 632.3MB in the end (delta: 447.7MB). Free memory was 136.6MB in the beginning and 297.2MB in the end (delta: -160.6MB). Peak memory consumption was 362.7MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: 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, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 39.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 32.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1463 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1463 mSDsluCounter, 2843 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1750 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3300 IncrementalHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 1093 mSDtfsCounter, 3300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 80 PreInvPairs, 97 NumberOfFragments, 799 HoareAnnotationTreeSize, 80 FomulaSimplifications, 1699038 FormulaSimplificationTreeSizeReduction, 31.0s HoareSimplificationTime, 80 FomulaSimplificationsInter, 2584793 FormulaSimplificationTreeSizeReductionInter, 1.3s 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 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && (((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0)) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-19 02:37:02,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...