./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:22:47,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:22:47,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:22:47,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:22:47,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:22:47,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:22:47,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:22:47,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:22:47,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:22:47,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:22:47,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:22:47,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:22:47,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:22:47,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:22:47,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:22:47,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:22:47,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:22:47,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:22:47,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:22:47,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:22:47,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:22:47,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:22:47,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:22:47,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:22:47,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:22:47,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:22:47,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:22:47,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:22:47,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:22:47,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:22:47,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:22:47,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:22:47,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:22:47,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:22:47,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:22:47,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:22:47,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:22:47,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:22:47,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:22:47,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:22:47,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:22:47,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:22:47,269 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:22:47,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:22:47,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:22:47,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:22:47,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:22:47,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:22:47,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:22:47,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:22:47,274 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:22:47,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:22:47,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:22:47,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:22:47,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:22:47,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:22:47,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:22:47,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:22:47,276 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:22:47,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:22:47,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:22:47,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:22:47,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:22:47,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:22:47,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:22:47,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:22:47,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:22:47,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:22:47,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:22:47,279 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:22:47,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:22:47,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:22:47,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2021-12-28 03:22:47,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:22:47,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:22:47,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:22:47,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:22:47,617 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:22:47,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-12-28 03:22:47,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f56dc28f/4152ff5c23c74d30b6ecfb4529e29abe/FLAGc9629d453 [2021-12-28 03:22:48,450 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:22:48,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-12-28 03:22:48,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f56dc28f/4152ff5c23c74d30b6ecfb4529e29abe/FLAGc9629d453 [2021-12-28 03:22:49,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f56dc28f/4152ff5c23c74d30b6ecfb4529e29abe [2021-12-28 03:22:49,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:22:49,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:22:49,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:22:49,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:22:49,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:22:49,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:22:49" (1/1) ... [2021-12-28 03:22:49,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c88eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:49, skipping insertion in model container [2021-12-28 03:22:49,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:22:49" (1/1) ... [2021-12-28 03:22:49,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:22:49,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:22:49,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2021-12-28 03:22:49,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2021-12-28 03:22:50,020 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,021 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,021 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,022 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,023 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,040 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,041 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,042 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,048 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,323 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:22:50,324 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:22:50,325 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:22:50,326 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:22:50,327 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:22:50,327 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:22:50,328 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:22:50,328 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:22:50,329 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:22:50,329 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:22:50,439 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:22:50,500 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,501 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:22:50,675 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:22:50,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2021-12-28 03:22:50,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2021-12-28 03:22:50,738 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,745 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,746 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,747 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,748 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,768 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,768 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,805 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:22:50,805 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:22:50,806 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:22:50,806 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:22:50,807 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:22:50,808 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:22:50,808 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:22:50,809 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:22:50,809 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:22:50,810 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:22:50,831 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:22:50,883 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,883 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:50,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:22:51,217 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:22:51,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51 WrapperNode [2021-12-28 03:22:51,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:22:51,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:22:51,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:22:51,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:22:51,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,433 INFO L137 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 879 [2021-12-28 03:22:51,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:22:51,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:22:51,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:22:51,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:22:51,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:22:51,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:22:51,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:22:51,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:22:51,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (1/1) ... [2021-12-28 03:22:51,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:22:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:22:51,573 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) [2021-12-28 03:22:51,595 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 [2021-12-28 03:22:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-28 03:22:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-28 03:22:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-28 03:22:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-28 03:22:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-28 03:22:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-28 03:22:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-28 03:22:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:22:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-28 03:22:51,616 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-28 03:22:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:22:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-28 03:22:51,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-28 03:22:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:22:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:22:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 03:22:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:22:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:22:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-28 03:22:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-28 03:22:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-28 03:22:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 03:22:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 03:22:51,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 03:22:51,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 03:22:51,622 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-12-28 03:22:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-12-28 03:22:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:22:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-28 03:22:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-28 03:22:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-28 03:22:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-28 03:22:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:22:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:22:51,891 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:22:51,894 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:22:53,021 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:22:53,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:22:53,029 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 03:22:53,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:22:53 BoogieIcfgContainer [2021-12-28 03:22:53,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:22:53,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:22:53,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:22:53,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:22:53,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:22:49" (1/3) ... [2021-12-28 03:22:53,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df2674d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:22:53, skipping insertion in model container [2021-12-28 03:22:53,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:51" (2/3) ... [2021-12-28 03:22:53,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df2674d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:22:53, skipping insertion in model container [2021-12-28 03:22:53,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:22:53" (3/3) ... [2021-12-28 03:22:53,039 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2021-12-28 03:22:53,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:22:53,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:22:53,102 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:22:53,109 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:22:53,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:22:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-28 03:22:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 03:22:53,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:53,152 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:53,152 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2021-12-28 03:22:53,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:53,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487173591] [2021-12-28 03:22:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:53,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 03:22:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 03:22:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 03:22:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-28 03:22:53,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487173591] [2021-12-28 03:22:53,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487173591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:53,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:53,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:22:53,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841997415] [2021-12-28 03:22:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:53,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:22:53,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:22:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:22:53,926 INFO L87 Difference]: Start difference. First operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 03:22:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:54,150 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2021-12-28 03:22:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:22:54,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2021-12-28 03:22:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:54,160 INFO L225 Difference]: With dead ends: 253 [2021-12-28 03:22:54,160 INFO L226 Difference]: Without dead ends: 126 [2021-12-28 03:22:54,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:22:54,166 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:54,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:22:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-28 03:22:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-28 03:22:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 85 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2021-12-28 03:22:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2021-12-28 03:22:54,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2021-12-28 03:22:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:54,229 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2021-12-28 03:22:54,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 03:22:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2021-12-28 03:22:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 03:22:54,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:54,238 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:54,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:22:54,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2021-12-28 03:22:54,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:54,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234033047] [2021-12-28 03:22:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:54,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 03:22:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 03:22:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 03:22:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-28 03:22:54,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234033047] [2021-12-28 03:22:54,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234033047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:54,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:54,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:22:54,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285232217] [2021-12-28 03:22:54,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:54,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:22:54,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:22:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:22:54,589 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:22:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:54,911 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2021-12-28 03:22:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:22:54,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 72 [2021-12-28 03:22:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:54,915 INFO L225 Difference]: With dead ends: 213 [2021-12-28 03:22:54,915 INFO L226 Difference]: Without dead ends: 129 [2021-12-28 03:22:54,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:22:54,917 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:54,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 405 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:22:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-28 03:22:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-28 03:22:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 88 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2021-12-28 03:22:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2021-12-28 03:22:54,929 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2021-12-28 03:22:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:54,929 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2021-12-28 03:22:54,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:22:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2021-12-28 03:22:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-28 03:22:54,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:54,931 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:54,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:22:54,932 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2021-12-28 03:22:54,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130559517] [2021-12-28 03:22:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:54,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:22:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 03:22:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:22:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-28 03:22:55,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:55,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130559517] [2021-12-28 03:22:55,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130559517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:55,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:55,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:22:55,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613948843] [2021-12-28 03:22:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:55,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:22:55,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:22:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:22:55,307 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-28 03:22:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:55,848 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2021-12-28 03:22:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:22:55,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2021-12-28 03:22:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:55,851 INFO L225 Difference]: With dead ends: 225 [2021-12-28 03:22:55,851 INFO L226 Difference]: Without dead ends: 167 [2021-12-28 03:22:55,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:22:55,852 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:55,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 571 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 03:22:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-28 03:22:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-12-28 03:22:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 35 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-12-28 03:22:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2021-12-28 03:22:55,871 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2021-12-28 03:22:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:55,872 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2021-12-28 03:22:55,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-28 03:22:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2021-12-28 03:22:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-28 03:22:55,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:55,876 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:55,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:22:55,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2021-12-28 03:22:55,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:55,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937484741] [2021-12-28 03:22:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:55,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:22:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 03:22:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:22:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-28 03:22:56,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937484741] [2021-12-28 03:22:56,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937484741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:56,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:56,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:22:56,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260473524] [2021-12-28 03:22:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:56,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:22:56,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:56,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:22:56,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:22:56,200 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 03:22:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:56,497 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2021-12-28 03:22:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:22:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2021-12-28 03:22:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:56,500 INFO L225 Difference]: With dead ends: 250 [2021-12-28 03:22:56,500 INFO L226 Difference]: Without dead ends: 194 [2021-12-28 03:22:56,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:22:56,501 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:56,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 381 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:22:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-28 03:22:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2021-12-28 03:22:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 51 states have call successors, (51), 11 states have call predecessors, (51), 12 states have return successors, (54), 50 states have call predecessors, (54), 50 states have call successors, (54) [2021-12-28 03:22:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2021-12-28 03:22:56,532 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2021-12-28 03:22:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:56,533 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2021-12-28 03:22:56,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 03:22:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2021-12-28 03:22:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-28 03:22:56,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:56,536 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:56,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:22:56,537 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2021-12-28 03:22:56,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:56,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800117376] [2021-12-28 03:22:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:56,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:22:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 03:22:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:22:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:22:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 03:22:56,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:56,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800117376] [2021-12-28 03:22:56,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800117376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:56,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:56,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:22:56,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166100320] [2021-12-28 03:22:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:56,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:22:56,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:22:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:22:56,813 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:22:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:57,311 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2021-12-28 03:22:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:22:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2021-12-28 03:22:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:57,317 INFO L225 Difference]: With dead ends: 203 [2021-12-28 03:22:57,317 INFO L226 Difference]: Without dead ends: 196 [2021-12-28 03:22:57,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:22:57,318 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:57,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 720 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:22:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-28 03:22:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-28 03:22:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-12-28 03:22:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2021-12-28 03:22:57,333 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2021-12-28 03:22:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:57,333 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2021-12-28 03:22:57,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:22:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2021-12-28 03:22:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 03:22:57,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:57,335 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:57,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:22:57,336 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2021-12-28 03:22:57,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:57,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292400451] [2021-12-28 03:22:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:57,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:22:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 03:22:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:22:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:22:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-28 03:22:57,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292400451] [2021-12-28 03:22:57,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292400451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:57,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:57,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:22:57,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750315086] [2021-12-28 03:22:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:57,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:22:57,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:22:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:22:57,643 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:22:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:58,036 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2021-12-28 03:22:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 03:22:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2021-12-28 03:22:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:58,038 INFO L225 Difference]: With dead ends: 362 [2021-12-28 03:22:58,038 INFO L226 Difference]: Without dead ends: 221 [2021-12-28 03:22:58,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:22:58,040 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:58,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 447 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:22:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-28 03:22:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-12-28 03:22:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 139 states have internal predecessors, (171), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-12-28 03:22:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2021-12-28 03:22:58,053 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2021-12-28 03:22:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:58,053 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2021-12-28 03:22:58,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:22:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2021-12-28 03:22:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 03:22:58,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:58,055 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:58,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 03:22:58,055 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2021-12-28 03:22:58,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721694576] [2021-12-28 03:22:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:58,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:22:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:22:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:22:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:22:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:22:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 03:22:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:22:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:22:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:22:58,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721694576] [2021-12-28 03:22:58,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721694576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:22:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103401113] [2021-12-28 03:22:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:58,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:22:58,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:22:58,695 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) [2021-12-28 03:22:58,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 03:22:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:59,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-28 03:22:59,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:22:59,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 03:22:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:22:59,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:22:59,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103401113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:59,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:22:59,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2021-12-28 03:22:59,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084708697] [2021-12-28 03:22:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:59,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:22:59,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:59,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:22:59,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:22:59,757 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-28 03:22:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:59,800 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2021-12-28 03:22:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 03:22:59,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2021-12-28 03:22:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:59,803 INFO L225 Difference]: With dead ends: 373 [2021-12-28 03:22:59,803 INFO L226 Difference]: Without dead ends: 220 [2021-12-28 03:22:59,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:22:59,804 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:59,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 941 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2021-12-28 03:22:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-28 03:22:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-12-28 03:22:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 157 states have internal predecessors, (194), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-12-28 03:22:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2021-12-28 03:22:59,817 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2021-12-28 03:22:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:59,817 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2021-12-28 03:22:59,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-28 03:22:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2021-12-28 03:22:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 03:22:59,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:59,819 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:59,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:00,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:00,042 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2021-12-28 03:23:00,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:00,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33701981] [2021-12-28 03:23:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:00,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:23:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 03:23:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:23:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:23:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-28 03:23:00,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33701981] [2021-12-28 03:23:00,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33701981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:00,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763069500] [2021-12-28 03:23:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:00,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:00,258 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) [2021-12-28 03:23:00,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 03:23:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 03:23:00,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-28 03:23:00,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:23:00,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763069500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:00,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:23:00,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-28 03:23:00,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941347781] [2021-12-28 03:23:00,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:00,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:23:00,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:23:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:23:00,813 INFO L87 Difference]: Start difference. First operand 220 states and 305 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:23:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:00,837 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2021-12-28 03:23:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:23:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2021-12-28 03:23:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:00,839 INFO L225 Difference]: With dead ends: 379 [2021-12-28 03:23:00,840 INFO L226 Difference]: Without dead ends: 229 [2021-12-28 03:23:00,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:23:00,841 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:00,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:23:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-28 03:23:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2021-12-28 03:23:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 149 states have internal predecessors, (185), 51 states have call successors, (51), 12 states have call predecessors, (51), 13 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2021-12-28 03:23:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2021-12-28 03:23:00,853 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2021-12-28 03:23:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:00,854 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2021-12-28 03:23:00,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:23:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2021-12-28 03:23:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-28 03:23:00,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:00,858 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:00,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-28 03:23:01,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-28 03:23:01,082 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2021-12-28 03:23:01,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:01,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897605613] [2021-12-28 03:23:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:01,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:23:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 03:23:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 03:23:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 03:23:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:23:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-28 03:23:01,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:01,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897605613] [2021-12-28 03:23:01,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897605613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:01,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732130557] [2021-12-28 03:23:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:01,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:01,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:01,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:01,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 03:23:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:01,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 03:23:01,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-28 03:23:02,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:23:02,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732130557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:02,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:23:02,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2021-12-28 03:23:02,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768686132] [2021-12-28 03:23:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:02,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:23:02,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:23:02,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:23:02,051 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:23:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:02,173 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2021-12-28 03:23:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:23:02,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2021-12-28 03:23:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:02,175 INFO L225 Difference]: With dead ends: 367 [2021-12-28 03:23:02,175 INFO L226 Difference]: Without dead ends: 217 [2021-12-28 03:23:02,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:23:02,176 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:02,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1191 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:23:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-28 03:23:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-28 03:23:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-28 03:23:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2021-12-28 03:23:02,189 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2021-12-28 03:23:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:02,191 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2021-12-28 03:23:02,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:23:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2021-12-28 03:23:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:23:02,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:02,194 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:02,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:02,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:02,411 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2021-12-28 03:23:02,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326456378] [2021-12-28 03:23:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:02,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-28 03:23:02,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:02,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326456378] [2021-12-28 03:23:02,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326456378] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:02,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502135246] [2021-12-28 03:23:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:02,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:02,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:02,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 03:23:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 03:23:03,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:23:03,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:23:03,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502135246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:03,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:23:03,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-28 03:23:03,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715386563] [2021-12-28 03:23:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:03,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:23:03,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:03,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:23:03,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:23:03,246 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:23:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:03,270 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2021-12-28 03:23:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:23:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2021-12-28 03:23:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:03,272 INFO L225 Difference]: With dead ends: 377 [2021-12-28 03:23:03,272 INFO L226 Difference]: Without dead ends: 220 [2021-12-28 03:23:03,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:23:03,273 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:03,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:23:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-28 03:23:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2021-12-28 03:23:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 154 states have internal predecessors, (187), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-28 03:23:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2021-12-28 03:23:03,283 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2021-12-28 03:23:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:03,283 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2021-12-28 03:23:03,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:23:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2021-12-28 03:23:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:23:03,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:03,285 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:03,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:03,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:03,508 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2021-12-28 03:23:03,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:03,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554549895] [2021-12-28 03:23:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:03,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-28 03:23:03,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:03,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554549895] [2021-12-28 03:23:03,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554549895] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:03,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513458773] [2021-12-28 03:23:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:03,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:03,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:03,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 03:23:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 03:23:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-28 03:23:04,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:23:04,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513458773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:04,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:23:04,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-28 03:23:04,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694145542] [2021-12-28 03:23:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:04,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:23:04,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:23:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:23:04,278 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:23:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:04,300 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2021-12-28 03:23:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:23:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2021-12-28 03:23:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:04,302 INFO L225 Difference]: With dead ends: 383 [2021-12-28 03:23:04,302 INFO L226 Difference]: Without dead ends: 226 [2021-12-28 03:23:04,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:23:04,304 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:04,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:23:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-28 03:23:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2021-12-28 03:23:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 150 states have internal predecessors, (180), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-28 03:23:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2021-12-28 03:23:04,313 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2021-12-28 03:23:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:04,314 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2021-12-28 03:23:04,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:23:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2021-12-28 03:23:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:23:04,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:04,316 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:04,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:04,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-28 03:23:04,532 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2021-12-28 03:23:04,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:04,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902282143] [2021-12-28 03:23:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:04,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-28 03:23:05,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:05,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902282143] [2021-12-28 03:23:05,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902282143] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226355448] [2021-12-28 03:23:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:05,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:05,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:05,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 03:23:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:05,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-28 03:23:05,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:23:06,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:23:06,943 INFO L353 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-28 03:23:06,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-12-28 03:23:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:23:07,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226355448] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:23:07,010 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:23:07,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2021-12-28 03:23:07,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291007544] [2021-12-28 03:23:07,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:23:07,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-28 03:23:07,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-28 03:23:07,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-12-28 03:23:07,012 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-28 03:23:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:08,241 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2021-12-28 03:23:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:23:08,242 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2021-12-28 03:23:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:08,244 INFO L225 Difference]: With dead ends: 259 [2021-12-28 03:23:08,244 INFO L226 Difference]: Without dead ends: 231 [2021-12-28 03:23:08,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2021-12-28 03:23:08,245 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 350 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:08,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 812 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1008 Invalid, 0 Unknown, 333 Unchecked, 0.8s Time] [2021-12-28 03:23:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-28 03:23:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2021-12-28 03:23:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 158 states have internal predecessors, (188), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-28 03:23:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2021-12-28 03:23:08,264 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2021-12-28 03:23:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:08,265 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2021-12-28 03:23:08,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-28 03:23:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2021-12-28 03:23:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:23:08,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:08,267 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:08,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:08,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:08,492 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2021-12-28 03:23:08,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:08,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284241371] [2021-12-28 03:23:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:08,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-28 03:23:08,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:08,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284241371] [2021-12-28 03:23:08,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284241371] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239952274] [2021-12-28 03:23:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:08,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:08,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:08,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 03:23:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:09,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-28 03:23:09,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:23:10,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:23:11,121 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-28 03:23:11,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 1 [2021-12-28 03:23:11,316 INFO L353 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2021-12-28 03:23:11,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2021-12-28 03:23:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:23:11,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239952274] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:23:11,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:23:11,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2021-12-28 03:23:11,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714585958] [2021-12-28 03:23:11,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:23:11,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-28 03:23:11,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-28 03:23:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2021-12-28 03:23:11,483 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2021-12-28 03:23:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:14,190 INFO L93 Difference]: Finished difference Result 353 states and 508 transitions. [2021-12-28 03:23:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-28 03:23:14,190 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 100 [2021-12-28 03:23:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:14,192 INFO L225 Difference]: With dead ends: 353 [2021-12-28 03:23:14,193 INFO L226 Difference]: Without dead ends: 341 [2021-12-28 03:23:14,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2021-12-28 03:23:14,194 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 313 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 616 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:14,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1454 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2074 Invalid, 0 Unknown, 616 Unchecked, 1.6s Time] [2021-12-28 03:23:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-28 03:23:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 334. [2021-12-28 03:23:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 235 states have internal predecessors, (282), 81 states have call successors, (81), 17 states have call predecessors, (81), 20 states have return successors, (117), 81 states have call predecessors, (117), 80 states have call successors, (117) [2021-12-28 03:23:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2021-12-28 03:23:14,218 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2021-12-28 03:23:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:14,219 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2021-12-28 03:23:14,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2021-12-28 03:23:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2021-12-28 03:23:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:23:14,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:14,221 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:14,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:14,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:14,432 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2021-12-28 03:23:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508758869] [2021-12-28 03:23:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:14,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-28 03:23:14,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:14,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508758869] [2021-12-28 03:23:14,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508758869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:14,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:23:14,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:23:14,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858888255] [2021-12-28 03:23:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:14,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:23:14,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:14,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:23:14,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:23:14,678 INFO L87 Difference]: Start difference. First operand 334 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:23:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:15,044 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2021-12-28 03:23:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:23:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2021-12-28 03:23:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:15,046 INFO L225 Difference]: With dead ends: 490 [2021-12-28 03:23:15,046 INFO L226 Difference]: Without dead ends: 325 [2021-12-28 03:23:15,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:23:15,048 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:15,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 446 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:23:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-28 03:23:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-12-28 03:23:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 81 states have call successors, (81), 17 states have call predecessors, (81), 19 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2021-12-28 03:23:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2021-12-28 03:23:15,070 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2021-12-28 03:23:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:15,072 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2021-12-28 03:23:15,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:23:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2021-12-28 03:23:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:23:15,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:15,076 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:15,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 03:23:15,077 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2021-12-28 03:23:15,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:15,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027144786] [2021-12-28 03:23:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:15,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:23:15,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027144786] [2021-12-28 03:23:15,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027144786] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:15,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394723405] [2021-12-28 03:23:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:15,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:15,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:15,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 03:23:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:16,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-28 03:23:16,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:23:17,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:23:18,119 INFO L353 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2021-12-28 03:23:18,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 48 [2021-12-28 03:23:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:23:18,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394723405] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:23:18,370 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:23:18,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2021-12-28 03:23:18,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325693780] [2021-12-28 03:23:18,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:23:18,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 03:23:18,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 03:23:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-12-28 03:23:18,372 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-28 03:23:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:20,675 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2021-12-28 03:23:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 03:23:20,676 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2021-12-28 03:23:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:20,678 INFO L225 Difference]: With dead ends: 349 [2021-12-28 03:23:20,678 INFO L226 Difference]: Without dead ends: 337 [2021-12-28 03:23:20,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2021-12-28 03:23:20,679 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:20,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 890 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1186 Invalid, 0 Unknown, 203 Unchecked, 1.0s Time] [2021-12-28 03:23:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-28 03:23:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2021-12-28 03:23:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 221 states have internal predecessors, (268), 81 states have call successors, (81), 17 states have call predecessors, (81), 18 states have return successors, (107), 81 states have call predecessors, (107), 80 states have call successors, (107) [2021-12-28 03:23:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2021-12-28 03:23:20,716 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2021-12-28 03:23:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:20,716 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2021-12-28 03:23:20,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-28 03:23:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2021-12-28 03:23:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-28 03:23:20,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:20,719 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:20,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:20,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-28 03:23:20,936 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2021-12-28 03:23:20,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:20,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066566806] [2021-12-28 03:23:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:20,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-28 03:23:21,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:21,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066566806] [2021-12-28 03:23:21,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066566806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:21,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:23:21,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 03:23:21,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484745211] [2021-12-28 03:23:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:21,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:23:21,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:23:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:23:21,206 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:23:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:21,714 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2021-12-28 03:23:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:23:21,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2021-12-28 03:23:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:21,716 INFO L225 Difference]: With dead ends: 331 [2021-12-28 03:23:21,716 INFO L226 Difference]: Without dead ends: 289 [2021-12-28 03:23:21,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:23:21,717 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:21,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 892 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 03:23:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-28 03:23:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2021-12-28 03:23:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (86), 68 states have call predecessors, (86), 67 states have call successors, (86) [2021-12-28 03:23:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2021-12-28 03:23:21,740 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2021-12-28 03:23:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:21,741 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2021-12-28 03:23:21,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:23:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2021-12-28 03:23:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-28 03:23:21,742 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:21,743 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:21,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 03:23:21,743 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2021-12-28 03:23:21,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:21,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308654269] [2021-12-28 03:23:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:21,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 03:23:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:23:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:23:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 03:23:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 03:23:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:23:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:23:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 03:23:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:23:22,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:22,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308654269] [2021-12-28 03:23:22,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308654269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:22,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:23:22,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-28 03:23:22,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252063480] [2021-12-28 03:23:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:22,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 03:23:22,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:22,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 03:23:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-28 03:23:22,421 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-28 03:23:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:23,411 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2021-12-28 03:23:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 03:23:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2021-12-28 03:23:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:23,413 INFO L225 Difference]: With dead ends: 295 [2021-12-28 03:23:23,413 INFO L226 Difference]: Without dead ends: 230 [2021-12-28 03:23:23,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2021-12-28 03:23:23,415 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:23,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 945 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 03:23:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-28 03:23:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2021-12-28 03:23:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2021-12-28 03:23:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2021-12-28 03:23:23,427 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2021-12-28 03:23:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:23,427 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2021-12-28 03:23:23,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-28 03:23:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2021-12-28 03:23:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-28 03:23:23,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:23,429 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:23,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 03:23:23,429 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2021-12-28 03:23:23,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:23,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278230802] [2021-12-28 03:23:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:23,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 03:23:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:23:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 03:23:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:23:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 03:23:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:23:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 03:23:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 03:23:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 03:23:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 03:23:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 03:23:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 03:23:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-28 03:23:23,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278230802] [2021-12-28 03:23:23,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278230802] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:23:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678519084] [2021-12-28 03:23:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:23,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:23:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:23:23,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:23:23,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 03:23:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:24,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 03:23:24,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:23:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-28 03:23:24,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:23:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-28 03:23:24,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678519084] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:23:24,882 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:23:24,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 24 [2021-12-28 03:23:24,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016604869] [2021-12-28 03:23:24,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:23:24,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-28 03:23:24,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-28 03:23:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2021-12-28 03:23:24,884 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2021-12-28 03:23:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:25,412 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2021-12-28 03:23:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:23:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) Word has length 118 [2021-12-28 03:23:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:25,413 INFO L225 Difference]: With dead ends: 185 [2021-12-28 03:23:25,413 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 03:23:25,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-12-28 03:23:25,415 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:25,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 305 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:23:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 03:23:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 03:23:25,416 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) [2021-12-28 03:23:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 03:23:25,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-12-28 03:23:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:25,416 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 03:23:25,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2021-12-28 03:23:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 03:23:25,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 03:23:25,418 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:23:25,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:25,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-28 03:23:25,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 03:23:28,958 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-28 03:23:28,959 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-28 03:23:28,959 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-28 03:23:28,959 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-28 03:23:28,959 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (or (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15)) .cse0) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (<= (* 18446744073709551616 (div (+ 18446744073709551615 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) [2021-12-28 03:23:28,959 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-28 03:23:28,959 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-28 03:23:28,959 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-28 03:23:28,960 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:28,960 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:28,960 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-28 03:23:28,960 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-28 03:23:28,960 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:28,960 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-28 03:23:28,960 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-28 03:23:28,961 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:28,961 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:23:28,961 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:23:28,961 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-28 03:23:28,961 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:28,961 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-12-28 03:23:28,961 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-12-28 03:23:28,961 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-12-28 03:23:28,962 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-12-28 03:23:28,962 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-12-28 03:23:28,962 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-12-28 03:23:28,962 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-12-28 03:23:28,962 INFO L858 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,962 INFO L858 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,962 INFO L858 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,962 INFO L858 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,963 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2021-12-28 03:23:28,963 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2021-12-28 03:23:28,963 INFO L858 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2021-12-28 03:23:28,963 INFO L858 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2021-12-28 03:23:28,963 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2021-12-28 03:23:28,963 INFO L858 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,963 INFO L858 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-28 03:23:28,964 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-28 03:23:28,965 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-28 03:23:28,965 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:23:28,965 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-28 03:23:28,965 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-28 03:23:28,965 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:23:28,965 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-28 03:23:28,965 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-28 03:23:28,965 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-28 03:23:28,966 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-28 03:23:28,966 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:28,966 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:28,966 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:28,966 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-28 03:23:28,966 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:28,966 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-28 03:23:28,967 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-28 03:23:28,967 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-28 03:23:28,967 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-28 03:23:28,967 INFO L854 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,967 INFO L858 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2021-12-28 03:23:28,967 INFO L854 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,968 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-12-28 03:23:28,968 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 03:23:28,968 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 03:23:28,968 INFO L854 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-28 03:23:28,968 INFO L861 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2021-12-28 03:23:28,968 INFO L858 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2021-12-28 03:23:28,968 INFO L858 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2021-12-28 03:23:28,969 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-28 03:23:28,969 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-28 03:23:28,969 INFO L854 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2021-12-28 03:23:28,969 INFO L858 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2021-12-28 03:23:28,969 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-28 03:23:28,969 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-28 03:23:28,969 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:23:28,969 INFO L858 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2021-12-28 03:23:28,970 INFO L854 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-28 03:23:28,970 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-12-28 03:23:28,970 INFO L858 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2021-12-28 03:23:28,970 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:23:28,970 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-28 03:23:28,970 INFO L858 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2021-12-28 03:23:28,970 INFO L854 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-28 03:23:28,971 INFO L858 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2021-12-28 03:23:28,971 INFO L854 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,971 INFO L854 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2021-12-28 03:23:28,971 INFO L854 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2021-12-28 03:23:28,971 INFO L858 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2021-12-28 03:23:28,971 INFO L858 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2021-12-28 03:23:28,972 INFO L854 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,972 INFO L858 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2021-12-28 03:23:28,972 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 03:23:28,972 INFO L858 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2021-12-28 03:23:28,972 INFO L854 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,972 INFO L854 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-28 03:23:28,973 INFO L858 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2021-12-28 03:23:28,973 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-28 03:23:28,973 INFO L858 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2021-12-28 03:23:28,973 INFO L854 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1| 0) .cse4 .cse5 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1|)) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,973 INFO L854 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,973 INFO L858 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2021-12-28 03:23:28,974 INFO L858 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2021-12-28 03:23:28,974 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-28 03:23:28,974 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 03:23:28,974 INFO L858 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2021-12-28 03:23:28,974 INFO L861 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2021-12-28 03:23:28,974 INFO L858 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2021-12-28 03:23:28,974 INFO L861 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2021-12-28 03:23:28,974 INFO L858 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2021-12-28 03:23:28,975 INFO L858 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2021-12-28 03:23:28,975 INFO L854 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-12-28 03:23:28,975 INFO L858 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2021-12-28 03:23:28,975 INFO L858 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2021-12-28 03:23:28,975 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,975 INFO L858 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2021-12-28 03:23:28,975 INFO L854 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-12-28 03:23:28,976 INFO L858 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2021-12-28 03:23:28,976 INFO L858 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2021-12-28 03:23:28,976 INFO L854 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse4 (select .cse5 16))) (let ((.cse1 (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse0 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)) .cse1 .cse2 .cse3) (and .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse0 (+ .cse4 (* 18446744073709551616 (div (+ (* (- 1) .cse4) 18446744073709551615 (* 18446744073709551616 (div .cse0 18446744073709551616))) 18446744073709551616)))) .cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-28 03:23:28,976 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-28 03:23:28,976 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-28 03:23:28,976 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-28 03:23:28,976 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:23:28,977 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:23:28,977 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-28 03:23:28,980 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:28,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:23:28,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:23:28,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-28 03:23:28,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:23:28,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-28 03:23:28,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:23:28 BoogieIcfgContainer [2021-12-28 03:23:28,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:23:28,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:23:28,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:23:28,997 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:23:28,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:22:53" (3/4) ... [2021-12-28 03:23:29,000 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 03:23:29,005 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-28 03:23:29,005 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-28 03:23:29,005 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-12-28 03:23:29,005 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-28 03:23:29,005 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-28 03:23:29,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-28 03:23:29,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-28 03:23:29,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-28 03:23:29,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-28 03:23:29,006 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-28 03:23:29,017 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2021-12-28 03:23:29,019 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-12-28 03:23:29,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-28 03:23:29,021 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-28 03:23:29,022 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-28 03:23:29,023 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-28 03:23:29,024 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 03:23:29,025 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 03:23:29,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2021-12-28 03:23:29,638 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 03:23:29,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:23:29,639 INFO L158 Benchmark]: Toolchain (without parser) took 40632.78ms. Allocated memory was 56.6MB in the beginning and 444.6MB in the end (delta: 388.0MB). Free memory was 35.7MB in the beginning and 131.9MB in the end (delta: -96.2MB). Peak memory consumption was 307.4MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,639 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:23:29,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2210.50ms. Allocated memory was 56.6MB in the beginning and 113.2MB in the end (delta: 56.6MB). Free memory was 35.4MB in the beginning and 51.9MB in the end (delta: -16.5MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 215.33ms. Allocated memory is still 113.2MB. Free memory was 51.9MB in the beginning and 62.5MB in the end (delta: -10.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,640 INFO L158 Benchmark]: Boogie Preprocessor took 103.19ms. Allocated memory is still 113.2MB. Free memory was 62.5MB in the beginning and 54.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,641 INFO L158 Benchmark]: RCFGBuilder took 1492.17ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 54.7MB in the beginning and 106.3MB in the end (delta: -51.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,641 INFO L158 Benchmark]: TraceAbstraction took 35963.74ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 105.2MB in the beginning and 181.6MB in the end (delta: -76.4MB). Peak memory consumption was 200.4MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,641 INFO L158 Benchmark]: Witness Printer took 641.51ms. Allocated memory is still 444.6MB. Free memory was 181.6MB in the beginning and 131.9MB in the end (delta: 49.7MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2021-12-28 03:23:29,642 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.16ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2210.50ms. Allocated memory was 56.6MB in the beginning and 113.2MB in the end (delta: 56.6MB). Free memory was 35.4MB in the beginning and 51.9MB in the end (delta: -16.5MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 215.33ms. Allocated memory is still 113.2MB. Free memory was 51.9MB in the beginning and 62.5MB in the end (delta: -10.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.19ms. Allocated memory is still 113.2MB. Free memory was 62.5MB in the beginning and 54.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1492.17ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 54.7MB in the beginning and 106.3MB in the end (delta: -51.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35963.74ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 105.2MB in the beginning and 181.6MB in the end (delta: -76.4MB). Peak memory consumption was 200.4MB. Max. memory is 16.1GB. * Witness Printer took 641.51ms. Allocated memory is still 444.6MB. Free memory was 181.6MB in the beginning and 131.9MB in the end (delta: 49.7MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR * 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: 223]: 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 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.9s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2204 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2057 mSDsluCounter, 12082 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1209 IncrementalHoareTripleChecker+Unchecked, 9298 mSDsCounter, 686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8823 IncrementalHoareTripleChecker+Invalid, 10718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 686 mSolverCounterUnsat, 2784 mSDtfsCounter, 8823 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1993 GetRequests, 1658 SyntacticMatches, 30 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=13, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1577 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 2961 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 16106 SizeOfPredicates, 75 NumberOfNonLiveVariables, 23635 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1856/2033 InterpolantCoveringCapability, 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 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: ((str == 0 && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2021-12-28 03:23:29,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:23:29,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-28 03:23:29,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:23:29,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR Derived loop invariant: (((((str == 0 && 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[buf][buf] / 18446744073709551616) + unknown-#memory_int-unknown[buf][buf]) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && buf == 0) || ((((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR] == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-1 * unknown-#memory_int-unknown[buf][16] + 18446744073709551615 + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) / 18446744073709551616)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2021-12-28 03:23:29,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE